A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
From MaRDI portal
Recommendations
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- An effective and fast heuristic for the dial-a-ride problem
- HEURISTIC ALGORITHMS FOR THE SINGLE VEHICLE DIAL-A-RIDE PROBLEM
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
Cites work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- A genetic algorithm for a bi-objective capacitated arc routing problem
- A GRASP with path-relinking for private virtual circuit routing
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A population-based algorithm for solving linear assignment problems with two objectives
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- GRASP with path relinking for three-index assignment
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- scientific article; zbMATH DE number 915988 (Why is no real title available?)
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Multi-objective vehicle routing problems
- Multi‐objective combinatorial optimization problems: A survey
- Optimization by simulated annealing
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
- Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection
- Path relinking for the vehicle routing problem
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Solving the Dial-a-Ride problem using genetic algorithms
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Tabu search for a multi-objective routing problem
- The bi-objective covering tour problem
- The dial-a-ride problem: Models and algorithms
- The General Pickup and Delivery Problem
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Two phase algorithms for the bi-objective assignment problem
Cited in
(23)- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- Typology and literature review for dial-a-ride problems
- Dynamic courier routing for a food delivery service
- Benchmarking online dispatch algorithms for emergency medical services
- Objectives and methods in multi-objective routing problems: a survey and classification scheme
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
- Event-based MILP models for ridepooling applications
- A survey on the applications of variable neighborhood search algorithm in healthcare management
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- Variable neighborhood search for the dial-a-ride problem
- The multi-objective generalized consistent vehicle routing problem
- Multi-directional local search
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- A matheuristic for tri-objective binary integer linear programming
- The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
- A deterministic annealing local search for the electric autonomous dial-a-ride problem
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
- A ride time-oriented scheduling algorithm for dial-a-ride problems
- An enhanced approach for the dial a ride problem with drivers preferences
- Optimizing transport operations in a hybrid mobility system for rural-urban transport
This page was built for publication: A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057122)
