Comparing descent heuristics and metaheuristics for the vehicle routing problem
From MaRDI portal
Publication:5926600
DOI10.1016/S0305-0548(99)00101-XzbMath0976.90018MaRDI QIDQ5926600
Publication date: 19 March 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items (25)
Routing relatively few customers per route ⋮ Multi-level supply chain network design with routing ⋮ Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm ⋮ Krill-Herd Support Vector Regression and heterogeneous autoregressive leverage: evidence from forecasting and trading commodities ⋮ An efficient variable neighborhood search heuristic for very large scale vehicle routing problems ⋮ A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes ⋮ A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints ⋮ Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms ⋮ Hybrid ant colony optimization algorithm applied to the multi-depot vehicle routing problem ⋮ Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data ⋮ A decision support system for a real vehicle routing problem. ⋮ Comparing different metaheuristic approaches for the median path problem with bounded length ⋮ Firefly Algorithm and Its Applications in Engineering Optimization ⋮ The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments ⋮ APPLYING METAHEURISTICS TO FEEDER BUS NETWORK DESIGN PROBLEM ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ A tabu search algorithm for the open vehicle routing problem ⋮ Simulation on vehicle routing problems in logistics distribution ⋮ A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints ⋮ A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows ⋮ Forecasting government bond spreads with heuristic models: evidence from the eurozone periphery ⋮ An algorithm for the capacitated vehicle routing problem with route balancing ⋮ The ALGACEA‐1 method for the capacitated vehicle routing problem ⋮ Optimal charging and repositioning of electric vehicles in a free-floating carsharing system ⋮ A parametric analysis of heuristics for the vehicle routing problem with side-constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Simulated annealing: A tool for operational research
- A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
- Routing problems: A bibliography
- Metaheuristics: A bibliography
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Solving real-life vehicle routing problems efficiently using tabu search
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Using simulated annealing to solve routing and location problems
- Simulated Annealing – An Annotated Bibliography
- Finding Groups in Data
- Parallel iterative search methods for vehicle routing problems
- Algorithms for the Vehicle Routing Problems with Time Deadlines
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Equation of State Calculations by Fast Computing Machines
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- A Method for Solving Traveling-Salesman Problems
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Problems in the Analysis of Survey Data, and a Proposal
This page was built for publication: Comparing descent heuristics and metaheuristics for the vehicle routing problem
