Pages that link to "Item:Q2840756"
From MaRDI portal
The following pages link to An efficient GVNS for solving traveling salesman problem with time windows (Q2840756):
Displaying 7 items.
- A general VNS heuristic for the traveling salesman problem with time windows (Q429659) (← links)
- Variable neighborhood search for the travelling deliveryman problem (Q1942008) (← links)
- An efficient heuristic for a hub location routing problem (Q2070128) (← links)
- Multi-objective vehicle routing and loading with time window constraints: a real-life application (Q2196102) (← links)
- Beam-ACO for the travelling salesman problem with time windows (Q2270441) (← links)
- Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection (Q2331437) (← links)
- Exact and anytime approach for solving the time dependent traveling salesman problem with time windows (Q6096613) (← links)