Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives
From MaRDI portal
Publication:6555172
DOI10.1016/j.ejor.2023.08.051MaRDI QIDQ6555172
Publication date: 14 June 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the traveling repairman problem on a line with general processing times and deadlines
- A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
- Pro-active real-time routing in applications with multiple request patterns
- On an exact method for the constrained shortest path problem
- Finding optimal tour schedules on transportation paths under extended time window constraints
- Pruning in column generation for service vehicle dispatching
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
- Picker routing in rectangular mixed shelves warehouses
- Warehousing in the e-commerce era: a survey
- Exact algorithms for the order picking problem
- A generic exact solver for vehicle routing and related problems
- A review of dynamic vehicle routing problems
- Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
- Ship routing and scheduling in the new millennium
- Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
- Diversion Issues in Real-Time Vehicle Dispatching
- Computer-Aided Complexity Classification of Dial-a-Ride Problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Heuristics for vehicle routing on tree-like networks
- Routing and Scheduling on a Shoreline with Release Times
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- The complexity of the travelling repairman problem
- An algorithm for the resource constrained shortest path problem
- Capacitated Vehicle Routing on Trees
- Special cases of traveling salesman and repairman problems with time windows
- Mersenne twister
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Multicriteria Optimization
This page was built for publication: Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives