Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
From MaRDI portal
Publication:2356017
DOI10.1016/j.ejor.2013.04.044zbMath1317.90330MaRDI QIDQ2356017
Publication date: 28 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.04.044
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
Related Items
Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization, VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties, Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm, An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup, Home care service planning. The case of Landelijke Thuiszorg, A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations, A practical vehicle routing problem with desynchronized arrivals to depot, Shipper collaboration in forward and reverse logistics, A hybrid genetic algorithm for the heterogeneous dial-a-ride problem, How to choose ``last mile delivery modes for E-fulfillment, A two-phase heuristic algorithm for the problem of scheduling and vehicle routing for delivery of medication to patients, Dynamic courier routing for a food delivery service, Research on medicine distribution route optimization for community health service institutions, Bi-objective approaches for home healthcare medical team planning and scheduling problem, Bicriteria vehicle routing problem with preferences and timing constraints in home health care services, A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit, A review of vehicle routing with simultaneous pickup and delivery, Temporal constraints and device management for the skill VRP: mathematical model and lower bounding techniques, A novel multi-objective green vehicle routing and scheduling model with stochastic demand, supply, and variable travel times, Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare, Dynamic routing-scheduling problem for home health care considering caregiver-patient compatibility, An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- A memetic algorithm for a vehicle routing problem with backhauls
- Comparing backhauling strategies in vehicle routing using ant colony optimization
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- The vehicle routing problem with backhauls
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- The pickup and delivery problem with time windows
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- A grouping genetic algorithm for the pickup and delivery problem with time windows
- Solution of the cumulative assignment problem with a well-structured tabu search method
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A new branching strategy for time constrained routing problems with application to backhauling
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Multi-ant colony system (MACS) for a vehicle routing problem with backhauls
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- Heuristic approaches to vehicle routing with backhauls and time windows
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Variable neighborhood search for the dial-a-ride problem
- Drive: Dynamic Routing of Independent Vehicles
- An Exact Method for the Vehicle Routing Problem with Backhauls
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Fast Algorithms for Geometric Traveling Salesman Problems
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- The single‐vehicle routing problem with unrestricted backhauls
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A GRASP for the Vehicle Routing Problem with Time Windows
- The General Pickup and Delivery Problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Vehicle routing problem with simultaneous deliveries and pickups
- The vehicle routing problem with pickups and deliveries on some special graphs
