The vehicle routing problem with time windows, widely used in practice, is an NP-hard problem. This paper presents a new meta-heuristic algorithm for solving the problem. Unlike traditional two-steps algorithms, the proposed optimization algorithm, based on the artificial bee colony algorithm combined with the vector evaluated technique, solves the problem as a multi-objective problem. As a res...

Abstract This paper investigates a problem that lies at the intersection of three research areas, namely automated negotiation, vehicle routing, and multi-objective optimization. Specifically, it scenario multiple competing logistics companies aim to cooperate by delivering truck loads for one another, in order improve efficiency reduce distance they drive. In do so, these need find ways exchan...

In the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot must perform all deliveries and profitable pickups while respecting time windows. The objective is to minimize routing costs, minus the revenue associated with the pickups. T...