A MILP-Based Very Large-Scale Neighborhood Search for the Heterogeneous Vehicle Routing Problem with Simultaneous Pickup and Delivery.
Napoleão NepomucenoRicardo Barboza SaboiaAndré L. V. CoelhoPublished in: GECCO (2023)
Keyphrases
- neighborhood search
- vehicle routing problem with simultaneous
- vehicle routing problem
- traveling salesman problem
- simulated annealing
- variable neighborhood search
- metaheuristic
- routing problem
- tabu search
- nature inspired
- heuristic methods
- mathematical programming
- linear program
- pick up and delivery
- neural network
- travel time
- path relinking
- particle swarm optimization
- evolutionary algorithm
- information retrieval
- graph search
- genetic algorithm ga
- linear programming