This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a large telecommunications company. This problem was solved within the framework of the 2007 challenge set up by the French Operational Research Society (ROADEF). The paper describes the authors’ entry in the competition which tied for second...

Optimization methods based on complete neighborhood exploration such as Tabu Search are impractical against large neighborhood problems. Strategies of candidate list propose a solution to reduce the neighborhood exploration complexity. We propose in this paper a generic Tabu Search algorithm using adaptive candidate list strategy based on two alternate candidate lists. Each candidate list strat...

<p style='text-indent:20px;'>In considering route optimization from multiple distribution centers called depots via some intermediate facilities satellites to final customers with commodities request, we introduce the Multi-Commodity Two-Echelon Vehicle Routing Problem Satellite Synchronization (MC-2E-VRPSS). The MC-2E-VRPSS involves transportation on first echelon and deliveries second e...

This paper addresses the optimisation of mineral value chains under metal and material type uncertainty. A mathematical model to simultaneously optimise extraction decisions destination is proposed. fix-and-optimise scheme that exploits structure problem uses relaxation decomposition techniques introduced obtain an initial solution, adaptive large neighbourhood search heuristic developed improv...

Considering autonomous delivery robots in urban logistics has attracted a great deal of attention recent years. In the meantime, new technology led to operational challenges, such as routing and scheduling vehicles together that are currently outside service providers’ capability. this paper, vehicle problem with time windows (VRPTWDR) variant classical VRP is studied. The investigated concerne...

Natural and technology-induced disasters have posed significant threats to human life all around the world caused many damages losses so far. The current study addresses a location-routing problem make an efficient timely distribution plan in response possible earthquake. This considers uncertainty such parameters as demand, access routes, travel time, number of available vehicles. To deal with...

In this paper we study a hub location problem in which the hubs to be located must form a set of interconnecting lines. The objective is to minimize the total weighted travel time between all pairs of nodes while taking into account a budget constraint on the total set-up cost of the hub network. A mathematical programming formulation, a Benders-branch-and-cut algorithm and several heuristic al...

This paper considers an extension of the vehicle routing problem with time windows, where the arrival of two vehicles at different customer locations must be synchronized. That is, one vehicle has to deliver some product to a customer, like a home theater system, while the crew on another vehicle must install it. This type of problem is often encountered in practice and is very challenging due ...