Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
From MaRDI portal
Publication:6106496
DOI10.1016/j.ejor.2022.07.039OpenAlexW4288809235MaRDI QIDQ6106496
Julian Baals, Simon Emde, Marcel Turkensteen
Publication date: 3 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.07.039
Related Items (1)
Cites Work
- Unnamed Item
- Multi-period vehicle routing problem with due dates
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- Disrupted capacitated vehicle routing problem with order release delay
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- Part logistics in the automotive industry: decision problems, literature review and research agenda
- A general heuristic for vehicle routing problems
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- Dynamic pickup and delivery problems
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- Sequential search and its application to vehicle-routing problems
- A unified solution framework for multi-attribute vehicle routing problems
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A review of vehicle routing with simultaneous pickup and delivery
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- Vehicle Routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Scheduling of storage/retrieval orders under a just-in-time environment
- A metaheuristic for the vehicle-routeing problem with soft time windows
- The Vehicle Routing Problem with Release and Due Dates
- Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- A unified tabu search algorithm for vehicle routing problems with soft time windows
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Handbook of metaheuristics
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Ship scheduling with soft time windows: An optimisation based approach
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
This page was built for publication: Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem
