scholarly journals A Deterministic Annealing Algorithm for a Bi-Objective Full Truckload Vehicle Routing Problem in Drayage Operations

2011 ◽  
Vol 20 ◽  
pp. 344-353 ◽  
Author(s):  
Kris Braekers ◽  
An Caris ◽  
Gerrit K. Janssens
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Deterministic Annealing ◽  
Routing Problem ◽  
Annealing Algorithm ◽  
Drayage Operations

scholarly journals Solving the Two Echelon Vehicle Routing Problem Using Simulated Annealing Algorithm Considering Drop Box Facilities and Emission Cost: A Case Study of Reverse Logistics Application in Indonesia

Algorithms ◽  
2021 ◽  
Vol 14 (9) ◽  
pp. 259
Author(s):  
Marco Reinaldi ◽  
Anak Agung Ngurah Perwira Redi ◽  
Dio Fawwaz Prakoso ◽  
Arrie Wicaksono Widodo ◽  
Mochammad Rizal Wibisono ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Carbon Emissions ◽  
Reverse Logistics ◽  
Vehicle Routing Problem ◽  
Distribution System ◽  
Simulated Annealing Algorithm ◽  
Routing Problem ◽  
Annealing Algorithm ◽  
Lower Carbon

A two echelon distribution system is often used to solve logistics problems. This study considers a two-echelon distribution system in reverse logistics context with the use of drop box facility as an intermediary facility. An optimization model of integer linear programming is proposed, representing a two-echelon vehicle routing problem with a drop box facility (2EVRP-DF). The aim is to find the minimum total costs consisting of vehicle transportation costs and the costs to compensate customers who have to travel to access these intermediary facilities. The results are then compared to those of common practice in reverse logistics. In common practice, customers are assumed to go directly to the depot to drop their goods. In addition, this study analyzes the environmental impact by adding a component of carbon emissions emitted by the vehicles. A set of comprehensive computational experiments is conducted. The results indicate that the 2EVRP-DF model can provide optimal costs and lower carbon emissions than the common practice.

scholarly journals Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows

2009 ◽  
Vol 3 (2) ◽  
pp. 87-100 ◽  
Author(s):  
Marcin Woch ◽  
Piotr Łebkowski
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Simulated Annealing Algorithm ◽  
Optimization Problems ◽  
Time Windows ◽  
High Quality ◽  
Routing Problem ◽  
Annealing Algorithm ◽  
Very High

This article presents a new simulated annealing algorithm that provides very high quality solutions to the vehicle routing problem. The aim of described algorithm is to solve the vehicle routing problem with time windows. The tests were carried out with use of some well known instances of the problem defined by M. Solomon. The empirical evidence indicates that simulated annealing can be successfully applied to bi-criterion optimization problems.

scholarly journals Vehicle Routing Problem with Time Windows: A Deterministic Annealing approach

2016 ◽  
Author(s):  
Mayank Baranwal ◽  
Pratik M. Parekh ◽  
Lavanya Marla ◽  
Srinivasa M. Salapaka ◽  
Carolyn L. Beck
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Deterministic Annealing ◽  
Routing Problem

Hybrid Genetic Simulated Annealing Algorithm with its Application in Vehicle Routing Problem with Time Windows

2010 ◽  
Vol 148-149 ◽  
pp. 395-398
Author(s):  
Qiang Zhang ◽  
Qing Guo Lin ◽  
Qin He Zhang ◽  
Ji Chen Fang ◽  
Zhan Gen Wang ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Simulated Annealing Algorithm ◽  
Time Windows ◽  
Routing Problem ◽  
Genetic Simulated Annealing Algorithm ◽  
Annealing Algorithm ◽  
Set Up ◽  
Delayed Time

Under the situations of distribution center and customer demand, a mathematical model of Vehicle Routing Problem with Time Windows(VRPTW) is set up, where the main factors of less total distance of vehicles driving and less delayed time of vehicles are considered. For the "premature" convergence in Genetic Algorithms, Simulated Annealing Algorithm is introduced, and GSA is designed to optimize and analyse the VRPTW examples. It is shown that the performance of GSA is better than Genetic Annealing(GA).

Sign in / Sign up

Export Citation Format

Share Document