Pages that link to "Item:Q2781094"
From MaRDI portal
The following pages link to A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows (Q2781094):
Displayed 41 items.
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- The delivery man problem with time windows (Q429673) (← links)
- A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
- The capacitated vehicle routing problem with stochastic demands and time windows (Q547129) (← links)
- Traveling salesman problem with clustering (Q616229) (← links)
- A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations (Q938004) (← links)
- A stochastic dynamic traveling salesman problem with hard time windows (Q1042055) (← links)
- A tabu search algorithm for scheduling a single robot in a job-shop environment (Q1602712) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- Tabu search heuristics for the vehicle routing problem with time windows. (Q1871417) (← links)
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
- A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows (Q1984692) (← links)
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study (Q2001870) (← links)
- A metaheuristic for the delivery man problem with time windows (Q2045024) (← links)
- Branch-and-refine for solving time-expanded MILP formulations (Q2108138) (← links)
- Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version (Q2108179) (← links)
- Improving the filtering of branch-and-bound MDD solver (Q2117223) (← links)
- Finding efficient make-to-order production and batch delivery schedules (Q2242200) (← links)
- Dynamic transportation of patients in hospitals (Q2267375) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- Dynamic vehicle routing using an improved variable neighborhood search algorithm (Q2375629) (← links)
- A modified ant colony system for solving the travelling salesman problem with time windows (Q2472698) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows (Q2815450) (← links)
- An efficient GVNS for solving Traveling Salesman Problem with Time Windows (Q2840756) (← links)
- An ant colony system approach for variants of the traveling salesman problem with time windows (Q3429053) (← links)
- Implementation of a linear time algorithm for certain generalized traveling salesman problems (Q4645932) (← links)
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
- The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches (Q5136080) (← links)
- Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows (Q5240195) (← links)
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← links)
- Learn global and optimize local: a data-driven methodology for last-mile routing (Q6047849) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)
- Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework (Q6168609) (← links)
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams (Q6426110) (← links)