scholarly journals Greedy approach for solving the capacitated vehicle routing problem of liquefied natural gas distribution to power plants

2019 ◽  
Vol 272 ◽  
pp. 01040
Author(s):  
A P A Wijharnasir ◽  
M A Alghasi ◽  
N Pujawan
Keyword(s):  
Vehicle Routing Problem ◽  
Power Plants ◽  
Transportation Cost ◽  
Operational Cost ◽  
Inventory Cost ◽  
Routing Problem ◽  
Greedy Approach ◽  
Cost Distance ◽  
Ship Route

In LNG industries, how to decide the number of ships and their routes for transporting LNG to every demand location efficiently effects the minimization of total operational cost. Therefore, this paper provides a case study in Papua and proposes a model to determine the optimum ship route to transport LNG from an LNG production terminal to thirteen regasification terminals by considering both transportation cost and inventory cost. Distance, power plants demands, transportation cost, and inventory cost were further analyzed by using the greedy approach. In addition, the ship sizes were limited to four alternatives, which were 2500 m3, 7500 m3, 10000 m3, and 23000 m3. The result recommends the utilization of smaller size vessels with more frequent shipments compared to the earlier research on the same case study. It considers that the result will be more adaptable for changing water depth due to changing tides at particular ports.

Improving Transportation Services for the University of the Thai Chamber of Commerce: A Case Study on Solving the Mixed-Fleet Vehicle Routing Problem with Split Deliveries

2009 ◽  
Author(s):  
N. Suthikarnnarunai ◽  
E. Olinick ◽  
Sio-Iong Ao ◽  
Alan Hoi-Shou Chan ◽  
Hideki Katagiri ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Transportation Services ◽  
Chamber Of Commerce ◽  
Split Deliveries ◽  
The University

A rich heterogeneous fleet vehicle routing problem with flexible time windows: a case study of dairy supply chain

2018 ◽  
Vol 30 (3) ◽  
pp. 386
Author(s):  
Mehdi Firouzi ◽  
Javid Jouzdani ◽  
Hadi Shirouyehzad ◽  
Mohammad Mahdi Paydar
Keyword(s):  
Supply Chain ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Heterogeneous Fleet

scholarly journals An improved two-phased heuristic algorithm for the capacitated vehicle routing problem and a case study

2020 ◽  
Vol 49 (4) ◽  
pp. 477
Author(s):  
M. K. D. D. Sandaruwan ◽  
D. M. Samarathunga ◽  
W. B. Daundasekara
Keyword(s):  
Vehicle Routing ◽  
Heuristic Algorithm ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

scholarly journals Methodology to Solve the Combination of the Generalized Assignment Problem and the Vehicle Routing Problem: A Case Study in Drug and Medical Instrument Sales and Service

2018 ◽  
Vol 9 (1) ◽  
pp. 3 ◽  
Author(s):  
Malichan Thongkham ◽  
Sasitorn Kaewman
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Search Techniques ◽  
De Algorithm ◽  
Local Searches ◽  
Generalized Assignment ◽  
Linear Probability

This article presents algorithms for solving a special case of the vehicle routing problem (VRP). We define our proposed problem of a special VRP case as a combination of two hard problems: the generalized assignment and the vehicle routing problem. The different evolution (DE) algorithm is used to solve the problem. The recombination process of the original DE is modified by adding two more sets of vectors—best vector and random vector—and using two other sets—target vector and trial vector. The linear probability formula is proposed to potentially use one out of the four sets of vectors. This is called the modified DE (MDE) algorithm. Two local searches are integrated into the MDE algorithm: exchange and insert. These procedures create a DE and MDE that use (1) no local search techniques, (2) two local search techniques, (3) only the exchange procedure, and (4) only the insert procedure. This generates four DE algorithms and four MDE algorithms. The proposed methods are tested with 15 tested instances and one case study. The current procedure is compared with all proposed heuristics. The computational result shows that, in the case study, the best DE algorithm (DE-4) has a 1.6% better solution than that of the current practice, whereas the MDE algorithm is 8.2% better. The MDE algorithm that uses the same local search as the DE algorithms generates a maximum 5.814% better solution than that of the DE algorithms.

scholarly journals The Periodic Vehicle Routing Problem: A Case Study

2008 ◽  
Author(s):  
Sofie Coene ◽  
Arent Arnout ◽  
Frits Spieksma
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Periodic Vehicle Routing Problem ◽  
Periodic Vehicle Routing

scholarly journals Improving service level and utilization of distribution using discrete event simulation by comparing three vehicle routing problem algorithm: A case study of drugs distribution company

2020 ◽  
Author(s):  
Arry Rahmawan Destyanto ◽  
Naufal Farras Fajar ◽  
Dwi Guna Mandhasiya ◽  
Faris Ahmad Mansur ◽  
Muhammad Zeid Masyhur ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Discrete Event Simulation ◽  
Vehicle Routing Problem ◽  
Discrete Event ◽  
Service Level ◽  
Routing Problem ◽  
Event Simulation ◽  
Distribution Company

A rich heterogeneous fleet vehicle routing problem with flexible time windows: a case study of dairy supply chain

2018 ◽  
Vol 30 (3) ◽  
pp. 386
Author(s):  
Hadi Shirouyehzad ◽  
Javid Jouzdani ◽  
Mehdi Firouzi ◽  
Mohammad Mahdi Paydar
Keyword(s):  
Supply Chain ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Heterogeneous Fleet
Sign in / Sign up

Export Citation Format

Share Document