Login / Signup
A greedy based algorithm for a bi-objective Pickup and Delivery Problem with Transfers.
Alexis Godart
Hervé Manier
Christelle Bloch
Marie-Ange Manier
Published in:
SMC (2019)
Keyphrases
</>
dynamic programming
computational complexity
bi objective
objective function
shortest path problem
cost function
greedy heuristic
search space
simulated annealing
computational efficiency
neural network
reinforcement learning
graphical models
optimization algorithm
hill climbing
locally optimal