Improved Integer Programming-Based Neighborhood Search for Less-Than-Truckload Load Plan Design

2016 ◽  
Vol 50 (4) ◽  
pp. 1360-1379 ◽  
Author(s):  
Kathleen Lindsey ◽  
Alan Erera ◽  
Martin Savelsbergh
Keyword(s):  
Integer Programming ◽  
Neighborhood Search ◽  
Plan Design ◽  
Load Plan

Improved Load Plan Design Through Integer Programming Based Local Search

2013 ◽  
Vol 47 (3) ◽  
pp. 412-427 ◽  
Author(s):  
Alan Erera ◽  
Michael Hewitt ◽  
Martin Savelsbergh ◽  
Yang Zhang
Keyword(s):  
Integer Programming ◽  
Local Search ◽  
Plan Design ◽  
Load Plan

scholarly journals A Heuristic Approach for a Real-World Electric Vehicle Routing Problem

Algorithms ◽  
2019 ◽  
Vol 12 (2) ◽  
pp. 45 ◽  
Author(s):  
Mengting Zhao ◽  
Yuwei Lu
Keyword(s):  
Integer Programming ◽  
Vehicle Routing ◽  
Electric Vehicle ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Heuristic Approach ◽  
Neighborhood Search ◽  
Operational Cost ◽  
Real World Data ◽  
Routing Problem

To develop a non-polluting and sustainable city, urban administrators encourage logistics companies to use electric vehicles instead of conventional (i.e., fuel-based) vehicles for transportation services. However, electric energy-based limitations pose a new challenge in designing reasonable visiting routes that are essential for the daily operations of companies. Therefore, this paper investigates a real-world electric vehicle routing problem (VRP) raised by a logistics company. The problem combines the features of the capacitated VRP, the VRP with time windows, the heterogeneous fleet VRP, the multi-trip VRP, and the electric VRP with charging stations. To solve such a complicated problem, a heuristic approach based on the adaptive large neighborhood search (ALNS) and integer programming is proposed in this paper. Specifically, a charging station adjustment heuristic and a departure time adjustment heuristic are devised to decrease the total operational cost. Furthermore, the best solution obtained by the ALNS is improved by integer programming. Twenty instances generated from real-world data were used to validate the effectiveness of the proposed algorithm. The results demonstrate that using our algorithm can save 7.52% of operational cost.

Penjadwalan Mesin dengan Metode Integer Linear Programming pada PT. XYZ

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Fransiskus Lauson Matondang ◽  
Rosnani Ginting
Keyword(s):  
Integer Programming ◽  
Time Delays ◽  
Parallel Machines ◽  
Research Concept ◽  
Total Settlement ◽  
Approach Method ◽  
Additional Costs ◽  
Maximum Completion Time ◽  
Completion Times ◽  
Better Than

PT XYZ sering mengalami keterlambatan waktu karena dalam setiap keterlambatan yang dilakukan selalu ada penalty yang diberikan kepada perusahaan dan hal ini mengakibatkan tambahan biaya , oleh karena itu hal ini harus dihindari dengan membuat penjadwalan yang efisien, dalam hal ini dilakukanlah perbaikan dengan meminimisasi waktu penyelesaian maksimum Cmax pada mesin paralel yang berpola aliran flowshop (dan tidak boleh dilakukan interupsi yang dilakukan pada pekerjaan yang sedang diproses, untuk melakukan pekerjaan lainnya, satu lintasan hanya memproduksi satu produk dan hanya satu produk juga yang dikerjakan secara langsung. Waktu penyelesaian yang berbeda dari setiap mesin dengan pengerjaannya juga adalah masalah yang dihadapi untuk menjadikan mesin mesin ini sesuai menjadi satu penjadwalan yang terintegrasi dengan metode integer programming yang membuat penjadwalan dengan konsep riset operasi dengan metode pendekatan 0-1 utuk menjadi lebih efisien lagi , dihasilkan minimisasi keterlambatan total penyelesaian order dengan 42,28 menit lebih baik dari sebelumnya.   PT XYZ often experiences time delays because in every delay made there is always a penalty given to the company and this results in additional costs, therefore this must be avoided by making efficient scheduling, in this case repairs are carried out by minimizing the maximum completion time of Cmax on parallel machines that are patterned with flowshop flow (and no interruptions should be carried out on the work being processed, to do other work, one track only produces one product and only one product is directly worked. Different completion times of each machine with the workmanship is also the problem faced to make this machine suitable to be one scheduling integrated with integer programming methods that makes scheduling with the operational research concept with the 0-1 approach method to be more efficient, resulting in minimization of the delay in the total settlement of orders with 42.28 minutes was better than before.

Sign in / Sign up

Export Citation Format

Share Document