The paper describes a procedure for the design of logistic systems involved in the “last mile” management for business to consumer e-commerce. Optimization of the resources and minimization of negative environmental impacts are the procedure’s objectives. The procedure was applied in Terni city area in Italy. A heuristic for the Location Routing Problem, adopting genetic algorithm (GA) as a sol...

This paper deals with a variant of the multifacility location-routing problem in urban areas. The distribution network is modelled by an undirected graph, which nodes are split into set pickup-delivery stations, depot, and customers. arcs represent minimum-cost connections between nodes. A customer assigned to station if he or she can reach it at lowest sustainable cost, i.e., on foot bicycle, ...

Online business has increased during the COVID-19 pandemic, but emergence of a number problems, namely reduced material supply, price fluctuations because an item is difficult to distribute and slow delivery due transportation goods based on type used (Trucks, Trains, Airplanes Ships). declines virus resulting in longer order waiting times. Pick-up Delivery Issues are variations Vehicle Routing...

We present a novel variation of the vehicle routing problem VRP . Single commodity cargo with pickup and delivery service is considered. Customers are labeled as either cargo sink or cargo source, depending on their pickup or delivery demand. This problem is called a single commodity vehicle routing problem with pickup and delivery service 1-VRPPD . 1-VRPPD deals with multiple vehicles and is t...

the seller must deliver the goods in conformity with the contract. one of cases of conformity is its conformity with the contract in terms of quantity. namely, the seller must deliver the goods that are equal with the specified amount in the contract. in practice, the delivered goods may be larger than the amount specified in the contract. in iranian law, where the goods are larger than contrac...

Splitting loads such that the delivery of certain loads is completed in multiple trips rather than one trip results in opportunities for a reduction in cost and the number of vehicles used. Several studies have shown the benefit of split deliveries for the Vehicle Routing Problem, in which a vehicle operating out of a depot makes a series of deliveries on each route. In this paper, we quantify ...

The real-time vehicle routing problem with time windows and simultaneous delivery products and pickup wastage materials (RT-VRPTWDPPWM) is formulated as extension of VRP. The real-time delivery/pickup demands are served by capacitated vehicles with limited initial loads. Moreover, pickup services aren't necessarily done after delivery services in each route. A improved genetic algorithm ( ...

The real-time vehicle routing problem with time windows and simultaneous delivery products and pickup wastage materials (RT-VRPTWDPPWM) is formulated as extension of VRP. The real-time delivery/pickup demands are served by capacitated vehicles with limited initial loads. Moreover, pickup services aren’t necessarily done after delivery services in each route. A improved genetic algorithm ( maste...

In the Vehicle Routing Problem with Pickup and Delivery (VRPPD), a set of transportation requests must be satisfied by capacitated vehicles based at one or several depots. Each request is defined by an origin (or pickup point), a destination (or delivery point), and a demand to be transported from the origin to the destination. Typical applications are parcel services and dial-a-ride transporta...

We consider the Capacitated Traveling Salesman Problem with Pickups and Deliveries (CTSPPD). This problem is characterized by a set of n pickup points and a set of n delivery points. A single product is available at the pickup points which must be brought to the delivery points. A vehicle of limited capacity is available to perform this task. The problem is to determine the tour the vehicle sho...