The multiple vehicle pickup and delivery problem with LIFO constraints
Approach a new pickup and delivery problem with LIFO and time constraints. Propose two formulations for the problem, together with several set of valid inequalities to improve them. Design an efficient branch and cut solution method to solve the problem to optimality. Develop a fast tabu search heuristic to find feasible solutions within short running times. Evaluate the performance of the proposed solution methods through a comprehensive computational study.
pickup and delivery lifo constraints branch and cut vehicle routing mixed-integer programming