Hybrid optimization methods for time-dependent sequencing problems
From MaRDI portal
Publication:1751901
DOI10.1016/j.ejor.2016.11.035zbMath1402.90053OpenAlexW2551102339MaRDI QIDQ1751901
Joris Kinable, Andre A. Cire, Willem-Jan van Hoeve
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.11.035
Related Items (19)
Constraint programming and operations research ⋮ Incorporating bounds from decision diagrams into integer programming ⋮ Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints ⋮ Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm ⋮ Sequencing mixed-model assembly lines with demand management: problem development and efficient multi-objective algorithms ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem ⋮ Single-machine scheduling with release times, deadlines, setup times, and rejection ⋮ Solving a Routing Problem with the Aid of an Independent Computations Scheme ⋮ On one routing problem modeling movement in radiation fields ⋮ Decision diagrams for solving traveling salesman problems with pickup and delivery in real time ⋮ Models and algorithms for the traveling salesman problem with time-dependent service times ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP ⋮ Exact Multiple Sequence Alignment by Synchronized Decision Diagrams ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding ⋮ A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
Cites Work
- Unnamed Item
- Unnamed Item
- An Alternative Family of Transformations
- Load-dependent and precedence-based models for pickup and delivery problems
- Time-dependent routing problems: a review
- The delivery man problem with time windows
- Improved filtering for weighted circuit constraints
- Natural and extended formulations for the time-dependent traveling salesman problem
- Integrated methods for optimization
- A new formulation for the traveling deliveryman problem
- Single-machine scheduling with learning considerations
- A classification of formulations for the (time-dependent) traveling salesman problem
- A polyhedral approach to single-machine scheduling problems.
- Scheduling problems with position dependent job processing times: computational complexity results
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- The time dependent traveling salesman problem: polyhedra and algorithm
- Machine scheduling problems with a position-dependent deterioration
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Some scheduling problems with general position-dependent and time-dependent learning effects
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Facets and valid inequalities for the time-dependent travelling salesman problem
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
- The minimum latency problem
- An integer programming approach for the time-dependent TSP
- Discrepancy-Based Additive Bounding Procedures
- Global Constraints: A Survey
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The Delivery Man Problem and Cumulative Matroids
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- Time‐dependent traveling salesman problem–the deliveryman case
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Multivalued Decision Diagrams for Sequencing Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem
- In Pursuit of the Traveling Salesman
- Scheduling
This page was built for publication: Hybrid optimization methods for time-dependent sequencing problems
