A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
From MaRDI portal
Publication:421661
DOI10.1016/j.ejor.2011.06.013zbMath1237.90134OpenAlexW2110456395MaRDI QIDQ421661
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.06.013
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Methods of successive quadratic programming type (90C55)
Related Items (3)
A nonlinear optimization model for the balanced vehicle routing problem with loading constraints ⋮ Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- Vehicle routing with full loads
- The pickup and delivery problem with time windows
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- Tabu search for the multilevel generalized assignment problem
- Vehicle routing-scheduling for waste collection in Hanoi
- A grouping genetic algorithm for the pickup and delivery problem with time windows
- Multi-depot vehicle scheduling problems with time windows and waiting costs
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The Vehicle Routing Problem
- Large-Scale, Less-than-Truckload Service Network Design
- Integrated Airline Fleeting and Crew-Pairing Decisions
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
- On some matching problems arising in vehicle scheduling models
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- The General Pickup and Delivery Problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- New hardness results for congestion minimization and machine scheduling
- A tabu search heuristic for the generalized assignment problem
This page was built for publication: A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
