Considering the vehicle routing problem with fuzzy demand and time windows, a optimization method is proposed considering both soft windows uncertain customer demand. First, chance-constrained programming model established based on credibility theory, minimizing total logistics cost. At same time, random simulation algorithm designed to calculate penalty cost of delivery failures caused by that...

To reduce the logistic cost and carbon emission improve customer satisfaction, this study proposes a multiobjective green time-dependent location routing problem (MOGTDLRP) model in which objectives are to minimize distribution total cost, delivery time, fuel consumption. This will be solved by several hyperheuristic algorithms include high-level heuristics low-level heuristics. There three acc...

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

This paper addresses a new vehicle routing problem that simultaneously involves time windows, split collection and linear weightrelated cost, which is a generalization of the split delivery vehicle routing problem with time windows (SDVRPTW). This problem consists of determining least-cost vehicle routes to serve a set of customers while respecting the restrictions of vehicle capacity and time ...

increasing of the distribution efficiency is one of the most objectives of an integrated logistic system developed as a new management philosophy in the past few decades. the problem is examind in two parts: facilities location problem (flp) for long policies and vehicle routing problem (vrp) to meet the customer demand. these two components can be solved separately; however, this solution may ...

The Vehicle Routing Problem with Simultaneous Pickup-Delivery and Time Windows (VRPSPDTW) has attracted much research interest in the last decade, due to its wide application modern logistics. Since VRPSPDTW is NP-hard exact methods are only applicable small-scale instances, heuristics meta-heuristics commonly adopted. In this paper we propose a novel Memetic Algorithm efficienT local search Ex...

This article concerns the “One-commodity Pickup-and-Delivery Traveling Salesman Problem” (1-PDTSP), in which a single vehicle of fixed capacity must either pick up or deliver known amounts of a single commodity to a given list of customers. It is assumed that the product collected from the pickup customers can be supplied to the delivery customers, and that the initial load of the vehicle leavi...