Recently, the quality and the diversity of transport services are more and more required. Moreover, in case of a great deal of services and selling goods, a significant part of price is transport cost. Thus, the design of models and applications which make possible efficient transport planning and scheduling becomes important. A great deal of real transport problems may be modelled by using Pic...

over the two last decades, distribution companies have been aware of the importance of paying attention to the all aspects of a distribution system simultaneously to be successful in the global market. these aspects are the economic, the environmental, the social and the safety aspects. in the vehicle routing problem (vrp) literature, the economic issue has often been used, while the environmen...

We propose local search algorithms for the vehicle routing problem with soft time window constraints. The time window constraint for each customer is treated as a penalty function, which is very general in the sense that it can be non-convex and discontinuous as long as it is piecewise linear. In our algorithm, we use local search to assign customers to vehicles and to find orders of customers ...

A key element of many distribution systems is the routing and scheduling of vehicles through a set of nodes requiring service. The Vehicle Routing Problem (VRP) can be defined as a problem of finding the optimal routes of delivery or collection from one or several depots to a number of cities or customers, while satisfying some constraints. In many practical situations, however, the vehicle is ...

Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Algorithms and Scatter Search coupled with a decomposition-into-petals procedure for solving a class of Vehicle Routing and Scheduling Problems. The parallel genetic algorithm presented is based on the island model and was run on...

the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...

centralizing and using proper transportation facilities cut down costs and traffic. hub facilities concentrate on flows to cause economic advantage of scale and multimodal transportation helps use the advantage of another transporter. a distinctive feature of this paper is proposing a new mathematical formulation for a three-stage p-hub location routing problem with simultaneous pick-ups and de...