In this chapter we are going to study metaheuristics based on the Automata Theory for the Multi-objective Optimization of Combinatorial Problems. As well known, Combinatorial Optimization is a branch of optimization. Its domain is optimization problems where the set of feasible solutions is discrete or can be reduced to a discrete one, and the goal is to find the best possible solution(Yong-Fa ...

This paper presents a multi objective approach to solve a Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). The proposed model was implemented and tested in a real life problem of a distribution company “Just in Time Delivery S.A” in Portugal. In this paper we have considered an objective function with two main goals: the first is to minimize the total number of vehicles used in t...

One of the important extensions of the classical resource allocation problem is integrated resource allocation and routing problem with time window (IRARPTW). IRARPTW problem focuses on the time window for the service at the demanding node with the consideration of travel time of vehicle for a varying demand-oriented multi echelon supply chain with the consideration of limitation on the number ...

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 Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous fleet of vehicles with limited capacity. In this paper, we propose and analyze the performance of an improved multi-objective evolutionary algorithm, that simultaneously minimizes the number of routes, the total travel d...

 We consider a pickup and delivery vehicle routing problem (PDP) commonly find in real-world logistics operations. The problem includes a set of practical complications that have received little attention in the vehicle routing literature. In this problem, there are multiple vehicle types available to cover a set of transportation orders, each of which has pickup time windows and delivery time...