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

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required nu...

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

in the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. on the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. effective transport activities are also one of the most important c...

This paper provides an indepth review on evolution of vehicle routing problems from savings matrix to time dependent vehicle routing problems. It is suggested that as to how VRPBH framework of Goetschalckx and Jacobs-Blecha has offered better solution to routing problems that Clarke-Wright Savings matrix and with the introduction of time -window concept the result of heuristic has improved dras...

VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I. The existing routing protocols for VAN...

General Optimization Methods Mathematical Programming, Constraint Programming, Heuristics Problem Specific Algorithms (Dynamic Programming, Branch and Bound) Scheduling Single and Parallel Machine Models Flow Shops and Flexible Flow Shops Job Shops Resource-Constrained Project Scheduling Timetabling Interval Scheduling, Reservations Educational Timetabling Workforce and Employee Timetabling Tra...