Pages that link to "Item:Q2270441"
From MaRDI portal
The following pages link to Beam-ACO for the travelling salesman problem with time windows (Q2270441):
Displaying 14 items.
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan (Q342431) (← links)
- An improved ant colony algorithm and its application in vehicle routing problem (Q474637) (← links)
- A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← 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)
- Environmental and social implications of incorporating carpooling service on a customized bus system (Q2146983) (← links)
- The hybrid electric vehicle-traveling salesman problem with time windows (Q2178092) (← 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)
- Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem (Q5114991) (← links)
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← links)
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)
