This paper presents a Pareto-based bi-objective optimization of hazardous materials vehicle routing and scheduling problem with time windows and shows its application to a realistic hazardous material logistics instance. A meta-heuristic solution algorithm is also proposed, which returns a set of routing solutions that approximate the frontier of the Pareto optimal solutions based on total sche...

The basic Vehicle Routing and Scheduling Problem (VRSP) is described followed by an outline of solution approaches. Different variations of the basic VRSP are examined that involve the consideration of additional constraints or other changes in the structure of the appropriate model. An introduction is provided to Green Logistics issues that are relevant to vehicle routing and scheduling includ...

The basic Vehicle Routing and Scheduling Problem (VRSP) is described followed by an outline of solution approaches. Different variations of the basic VRSP are examined that involve the consideration of additional constraints or other changes in the structure of the appropriate model. An introduction is provided to Green Logistics issues that are relevant to vehicle routing and scheduling includ...

In this paper we model and solve the multi-depot fleet size and mix vehicle routing problem (MDFSMVRP). This problem extends the multi-depot vehicle routing problem and the fleet size and mix vehicle routing problem, two logistics problems that have been extensively studied for many decades. This difficult transportation problem combines complex assignment and routing decisions under the object...

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 investigate a decision support system (dss) for the resolution of real-life vehicle routing and scheduling problem (vrsp). scheduling the deliveries from a regional distribution centre (rdc) to large stores of a major fmcg retailer includes every possible vehicle routing complexity. usual constraints that are seen are: size of the vehicle and the length of the driving day, loa...

this paper presents a multi-criteria vehicle routing problem with soft time windows (vrpstw) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. in this case, the fleet is heterogene-ous. the vrpstw consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. it is assumed that this relaxation a...

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 vrpspd...

Vehicle Routing Problem is a well-known problem in logistics and transportation, and the variety of such problems is explained by the fact that it occurs in many real-life situations. It is an NP-hard combinatorial optimization problem and finding an exact optimal solution is practically impossible. In this work, SiteDependent Truck and Trailer Routing Problem with hard and soft Time Windows an...

Products distribution is a process on which products are moved from sources to customers. According to Toth and Vigo [1], transportation costs typically represent 10-20% of the final price of goods on the market. Over the past 20 years, Vehicle Routing Problem (VRP) was especially solved through the use of meta-heuristics, see Jozefowiez et al. [2], Vidal et al. [3]. Eksioglu et al. [4] made a ...