The Vehicle Routing Problem with Time Windows Part II: Genetic Search

From MaRDI portal
Publication:5284225

DOI10.1287/ijoc.8.2.165zbMath0866.90058OpenAlexW2017209461MaRDI QIDQ5284225

Jean-Yves Potvin, Samy Bengio

Publication date: 22 January 1997

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.8.2.165



Related Items

A simple and effective evolutionary algorithm for the vehicle routing problem, A parallel hybrid genetic algorithm for the vehicle routing problem with time windows, An evolutionary algorithm for the vehicle routing problem with route balancing, Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows, A hybrid metaheuristic approach for the capacitated arc routing problem, Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation, A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows, Scheduled penalty variable neighborhood search, A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows, History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence, An effective hybrid search algorithm for the multiple traveling repairman problem with profits, Metaheuristics: A bibliography, Exact and anytime approach for solving the time dependent traveling salesman problem with time windows, Metaheuristics: A Canadian Perspective, Local search with annealing-like restarts to solve the VRPTW, A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network, A general variable neighborhood search for the traveling salesman problem with time windows under various objectives, Genetic local search with distance preserving recombination operator for a vehicle routing problem., A heuristic algorithm for solving hazardous materials distribution problems., Optimization of real-time multiserver system with two different channels and shortage of maintenance facilities., Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows, A hybrid genetic algorithm for the multi-depot open vehicle routing problem, Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams, A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem, A variable iterated greedy algorithm for the traveling salesman problem with time windows, A modified ant colony system for solving the travelling salesman problem with time windows, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, A two-phase hybrid metaheuristic for the vehicle routing problem with time windows, Beam-ACO for the travelling salesman problem with time windows, Determination of fuzzy logic membership functions using genetic algorithms, A memetic algorithm for the vehicle routing problem with time windows, Adaptive memory programming: a unified view of metaheuristics, A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows, Algorithm for directing cooperative vehicles of a vehicle routing problem for improving fault-tolerance, Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows, A route-neighborhood-based metaheuristic for vehicle routing problem with time windows, New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows, Study on man power planning of hospital transportation department by using VRPSTW, Scatter search for the vehicle routing problem with time windows, Real-time multiserver and multichannel systems with shortage of maintenance crews., Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version, Improving the filtering of branch-and-bound MDD solver, A genetic algorithm for the vehicle routing problem