The location-routing problem (LRP), which integrates location and routing decisions, has been an attraction to both researchers and practitioners. LRP as an important business problem has its own inherent uncertainty; especially, considering phenomena such as traffic congestion and weather conditions and their impact on transportation costs, routing in LRP is subject to uncertainty. In this pap...

In this contribution we optimize the transportation of containers in the hinterland of a local area with one terminal and one depot for empty containers and trucks. There are several customers who want to receive goods by inbound containers and several customers who want to ship goods by outbound containers. Additionally, there are empty inbound containers and empty outbound containers. We pres...

The multi-depot pickup and delivery problem with heterogeneous fleet and soft time windows (MDPDPHSTW) requires to find a minimum cost routing for a fleet vehicles with different capacities and based at different depots, satisfying a given set of customers. A customer request is associated with two locations: a source where a certain demand must be picked up and a destination where this demand ...

Establishing innovative fulfillment options for online orders has become a key challenge bricks-and-mortar retailers. A mere focus on store sales is no longer affordable due to the competition by pure players. Retailers are continuously developing new approaches order and last-mile logistics. Further shortening lead times becoming even more important in this context. One recently developed conc...

Multi-echelon distribution systems are quite common in supply-chain and logistic management. They are used by public administrations in their transportation and traffic planning strategies as well as by companies to model their distribution systems. In the literature, most studies address issues related to the movement of flows throughout the system from the origins to their final destinations....

in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...

The Capacitated Vehicle Routing problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP isan important problem in the fields of transportation, distribution and logistics . Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization prob...

In this contribution we optimize the transportation of containers in the hinterland of a local area with one terminal and one depot for empty containers and trucks. There are several customers who want to receive goods by inbound containers and several customers who want to ship goods by outbound containers. Additionally, there are empty inbound containers and empty outbound containers. We pres...

When a disaster strikes an area, often international assistance is requested to help responding and recovering from the disaster. The response characterized by dispatch of relief items affected regions via depots Humanitarian Logistics Service Providers (HLSPs). One challenges HLSP faces how organize its network depots. Important questions are many should be opened what their locations be? We d...

This paper addresses a multiple depot vehicle scheduling problem (MDVSP) arising in public transportation. The general problem consists in assigning vehicles to trips while minimising the number of scheduled vehicles and the operational costs. The MDVSP considered here takes into account heterogeneous types of vehicles with complex relations among them. This special feature matches well situati...