Pages that link to "Item:Q2491337"
From MaRDI portal
The following pages link to Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337):
Displayed 11 items.
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947) (← links)
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (Q953302) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities (Q1722978) (← links)
- The close-open mixed vehicle routing problem (Q1926744) (← links)
- Path relinking for the vehicle routing problem (Q2491329) (← links)
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (Q2494814) (← links)
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
- An Investigation on Compound Neighborhoods for VRPTW (Q2980168) (← links)