Fast local search algorithms for the handicapped persons transportation problem
From MaRDI portal
Publication:2573013
DOI10.1007/s10732-005-1997-2zbMath1122.90400OpenAlexW2014596969MaRDI QIDQ2573013
Tore Grünert, Birger Funke, Stefan Irnich
Publication date: 7 November 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-005-1997-2
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem ⋮ Data mining-based dispatching system for solving the local pickup and delivery problem ⋮ The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands ⋮ Large multiple neighborhood search for the soft-clustered vehicle-routing problem ⋮ Dynamic dispatching for interbay automated material handling with lot targeting using improved parallel multiple-objective genetic algorithm ⋮ A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot ⋮ Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem ⋮ In-depth analysis of granular local search for capacitated vehicle routing ⋮ Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems ⋮ MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ An iterated local search algorithm for a place scheduling problem ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ LS(graph): a constraint-based local search for constraint optimization on trees and paths ⋮ Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees ⋮ Vehicle Routing Problems with Inter-Tour Resource Constraints ⋮ Large multiple neighborhood search for the clustered vehicle-routing problem ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ Solution of real-world postman problems ⋮ Restricted dynamic programming: a flexible framework for solving realistic VRPs ⋮ Vehicle routing under time-dependent travel times: the impact of congestion avoidance ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty ⋮ Dynamic programming based metaheuristics for the dial-a-ride problem ⋮ On the one-to-one pickup-and-delivery problem with time windows and trailers ⋮ Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty ⋮ General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic ⋮ A characterization of odd-hole inequalities related to Latin squares ⋮ Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- New classes of efficiently solvable generalized traveling salesman problems
- An algorithm for the planar three-index assignment problem
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- The traveling salesman problem and its variations
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Record breaking optimization results using the ruin and recreate principle
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Sequential search and its application to vehicle-routing problems
- A note on single alternating cycle neighborhoods for the TSP
- The Vehicle Routing Problem
- A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
- The Shortest Path Problem with Time Windows and Linear Waiting Costs
- A Subpath Ejection Method for the Vehicle Routing Problem
- Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- A Multilevel Approach to the Travelling Salesman Problem
- A multiphase approach to the period routing problem
- Fast Algorithms for Geometric Traveling Salesman Problems
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Parallel iterative search methods for vehicle routing problems
- A guide to vehicle routing heuristics
- Halin graphs and the travelling salesman problem
- The General Pickup and Delivery Problem
- A new heuristic for the traveling salesman problem
- Shortest Path Problems with Resource Constraints
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- A heuristic for the vehicle routing problem with time windows
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
