this research presents and solves a new mathematical model for school bus routing problem (sbrp). sbrp is a specific case of vehicle routing problem (vrp). despite prevalent models, this model includes location and routing simultaneously. besides, the vehicles are non-homogenous. in addition, instead of locating schools which are the depots, we consider locating bus stops that are mentioned &ap...

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

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...

The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...

This research present a set-partitioning heuristic to generate populations in a hybrid genetic algorithm (hGA) which is able to solve four different variants of the vehicle routing problem: the multi-depot vehicle routing problem (MDVRP), the heterogeneous fleet and mix decisions (type, size and number of vehicle) (HFMVRP), site dependent vehicle routing problem (SDVRP) and the asymmetric vehic...

We study the Mixed Capacitated General Routing Problem (MCGRP) in which a fleet of capacitated vehicles has to serve a set of requests by traversing a mixed weighted graph. The requests may be located on nodes, edges, and arcs. The problem has theoretical interest because it is a generalization of the Capacitated Vehicle Routing Problem (CVRP), the Capacitated Arc Routing Problem (CARP), and th...

Collection of waste is an important logistic activity within any city. In this study, a mathematical model is proposed in order to reduce the cost of waste collection. First a mixed-integer nonlinear programming model is provided including a waste collection routing problem, so that, there is a balance between the distance between trashcans, and the similarity of the trashcans in terms of th...

In this work, a Rich Vehicle Routing Problem (RVRP) is faced for solving city logistic problems. particular, we deal with the problem of company that has to define best distribution strategy obtaining an efficient usage vehicles and reducing transportation costs while serving customers different priority demands during given planning horizon. Thus, multi-period vehicle routing heterogeneous fle...

In this work, the capacitated location-routing problem with simultaneous pickup and delivery (CLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem (CLRP) and belongs to the reverse logistics of the supply chain. The problem has many real-life applications of which some have been addressed in the literature such as management of liquid petrol...

The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...