Fast local search algorithms for the handicapped persons transportation problem
From MaRDI portal
Publication:2573013
DOI10.1007/S10732-005-1997-2zbMATH Open1122.90400OpenAlexW2014596969MaRDI QIDQ2573013FDOQ2573013
Authors: Birger Funke, Tore Grünert, 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
Recommendations
- scientific article; zbMATH DE number 1054963
- A survey of very large-scale neighborhood search techniques
- scientific article; zbMATH DE number 1766758
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Search theory (90B40) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- An Efficient Heuristic Procedure for Partitioning Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shortest Path Problems with Resource Constraints
- The traveling salesman problem and its variations
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- The vehicle routing problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Halin graphs and the travelling salesman problem
- Title not available (Why is that?)
- A heuristic for the vehicle routing problem with time windows
- Title not available (Why is that?)
- A survey of very large-scale neighborhood search techniques
- Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
- Record breaking optimization results using the ruin and recreate principle
- Title not available (Why is that?)
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- The General Pickup and Delivery Problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Parallel iterative search methods for vehicle routing problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Solutions of the Traveling Salesman Problem
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- A generalized insertion heuristic for the travelling salesman problem with time windows
- A multiphase approach to the period routing problem
- A guide to vehicle routing heuristics
- Sequential search and its application to vehicle-routing problems
- Fast Algorithms for Geometric Traveling Salesman Problems
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- New classes of efficiently solvable generalized traveling salesman problems
- A Multilevel Approach to the Travelling Salesman Problem
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- A note on single alternating cycle neighborhoods for the TSP
- Title not available (Why is that?)
- A new heuristic for the traveling salesman problem
- 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 algorithm for the planar three-index assignment problem
- Title not available (Why is that?)
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (30)
- Solution of real-world postman problems
- 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
- Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
- Data mining-based dispatching system for solving the local pickup and delivery problem
- A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem
- A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty
- A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance
- Industrial aspects and literature survey: fleet composition and routing
- Large multiple neighborhood search for the clustered vehicle-routing problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Dynamic programming based metaheuristics for the dial-a-ride problem
- A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- An iterated local search algorithm for a place scheduling problem
- 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
- 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
- Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
- Vehicle Routing Problems with Inter-Tour Resource Constraints
- A characterization of odd-hole inequalities related to Latin squares
- In-depth analysis of granular local search for capacitated vehicle routing
Uses Software
This page was built for publication: Fast local search algorithms for the handicapped persons transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573013)
