Logistics and transportation issues have been receiving increasing attention during the last decades and their requirements have gradually changed, making it necessary to take into account new situations and conditions. The Double Traveling Salesman Problem with Multiple Stacks (DTSPMS) is a...

This paper presents several heuristics for a variation of the vehicle routing problem in which the transportation fleet is composed of electric vehicles with limited autonomy in need for recharge during their duties. In addition to the routing plan, the amount of energy recharged and the...

Given a graph G=(V,E), a coloring function C assigns an integer value C(i) to each node i[set membership, variant]V in such a way that the extremes of any edge {i,j}[set membership, variant]E cannot share the same color, i.e., C(i)[not equal to]C(j). Two different approaches to the graph...

This paper approaches a pickup and delivery problem with multiple vehicles in which LIFO conditions are imposed when performing loading and unloading operations and the route durations cannot exceed a given limit. We propose two mixed integer formulations of this problem and a heuristic...

This paper presents a three-stage mixed-integer stochastic programming model for disaster response planning, considering the opening of local distribution facilities, initial allocation of supplies, and last mile distribution of aid. The vehicles available for transportation, the state of the...