Journal ArticleDOI
Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm
Keivan Ghoseiri,Seyed Farid Ghannadpour +1 more
- Vol. 10, Iss: 4, pp 1096-1107
Reads0
Chats0
TLDR
A direct interpretation of the VRPTW as a multi-objective problem where both the total required fleet size and total traveling distance are minimized while capacity and time windows constraints are secured.Abstract:
This paper presents a new model and solution for multi-objective vehicle routing problem with time windows (VRPTW) using goal programming and genetic algorithm that in which decision maker specifies optimistic aspiration levels to the objectives and deviations from those aspirations are minimized. VRPTW involves the routing of a set of vehicles with limited capacity from a central depot to a set of geographically dispersed customers with known demands and predefined time windows. This paper uses a direct interpretation of the VRPTW as a multi-objective problem where both the total required fleet size and total traveling distance are minimized while capacity and time windows constraints are secured. The present work aims at using a goal programming approach for the formulation of the problem and an adapted efficient genetic algorithm to solve it. In the genetic algorithm various heuristics incorporate local exploitation in the evolutionary search and the concept of Pareto optimality for the multi-objective optimization. Moreover part of initial population is initialized randomly and part is initialized using Push Forward Insertion Heuristic and @l-interchange mechanism. The algorithm is applied to solve the benchmark Solomon's 56 VRPTW 100-customer instances. Results show that the suggested approach is quiet effective, as it provides solutions that are competitive with the best known in the literature.read more
Citations
More filters
Journal ArticleDOI
The vehicle routing problem
TL;DR: This classification is the first to categorize the articles of the VRP literature to this level of detail and is based on an adapted version of an existing comprehensive taxonomy.
Journal ArticleDOI
A literature review on the vehicle routing problem with multiple depots
Jairo R. Montoya-Torres,Julián López Franco,Santiago Nieto Isaza,Heriberto Felizzola Jiménez,Nilson Herazo-Padilla +4 more
TL;DR: A state-of-the-art survey on the vehicle routing problem with multiple depots (MDVRP) is presented, considered papers published between 1988 and 2014, in which several variants of the model are studied.
Journal ArticleDOI
A survey of genetic algorithms for solving multi depot vehicle routing problem
Sašo Karakatič,Vili Podgorelec +1 more
TL;DR: A survey of genetic algorithms that are designed for solving multi depot vehicle routing problem, and the efficiency of different existing genetic methods on standard benchmark problems in detail are presented.
Journal ArticleDOI
An ant colony algorithm for the multi-compartment vehicle routing problem
TL;DR: The Ant Colony System (ACS) is used to solve the capacitated vehicle routing problem associated with collection of recycling waste from households, treated as nodes in a spatial network and produces high-quality solutions for two-compartment test problems.
Journal ArticleDOI
A Taxonomic Review of Metaheuristic Algorithms for Solving the Vehicle Routing Problem and Its Variants
Raafat Elshaer,Hadeer Awad +1 more
TL;DR: Based on a metaheuristic classification, 299 VRP articles published between 2009 and 2017 are classified to reveal the usage trends of the algorithms and the solved VRP variants for showing the ones that are most popular, and those that are promising topics for future research.
References
More filters
Book
Adaptation in natural and artificial systems
TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Book
Genetic Algorithms + Data Structures = Evolution Programs
TL;DR: GAs and Evolution Programs for Various Discrete Problems, a Hierarchy of Evolution Programs and Heuristics, and Conclusions.
Journal ArticleDOI
Ant colony system: a cooperative learning approach to the traveling salesman problem
TL;DR: The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and it is concluded comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs.
Journal ArticleDOI
Algorithms for the vehicle routing and scheduling problems with time window constraints
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Journal ArticleDOI
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Joshua Knowles,David Corne +1 more
TL;DR: The Pareto Archived Evolution Strategy (PAES) as discussed by the authors is a (1 + 1) evolution strategy employing local search but using a reference archive of previously found solutions in order to identify the approximate dominance ranking of the current and candidate solution vectors.