Pages that link to "Item:Q2892314"
From MaRDI portal
The following pages link to A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows (Q2892314):
Displayed 27 items.
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
- Annealing a genetic algorithm for constrained optimization (Q613595) (← links)
- An optimization approach for communal home meal delivery service: A case study (Q837090) (← links)
- Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456) (← links)
- A stochastic dynamic traveling salesman problem with hard time windows (Q1042055) (← links)
- Dynamic vehicle routing problems with enhanced ant colony optimization (Q1726966) (← links)
- A hybrid ant colony optimization for dynamic multidepot vehicle routing problem (Q1727073) (← 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)
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration (Q2177830) (← links)
- The hybrid electric vehicle-traveling salesman problem with time windows (Q2178092) (← links)
- Operational aircraft maintenance routing problem with remaining time consideration (Q2256235) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- Influence maximization with deactivation in social networks (Q2424770) (← 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)
- Performance evaluation of dynamic scheduling approaches in vehicle-based internal transport systems (Q3168926) (← links)
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)
- (Q6160407) (← 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)