1,993 research outputs found
An ant colony algorithm for the mixed vehicle routing problem with backhauls
The Vehicle Routing Problem with Pickup and Delivery (VRPPD) is a variant of the Vehicle Routing Problem where the vehicles are not only required to deliver goods but also to pick up some goods from the customers. The Mixed Vehicle Routing Problem with Backhauls (MVRPB) is a special case of VRPPD where each customer has either a delivery or a pickup demand to be satisfied and the customers can be visited in any order along the route. Given a fleet of vehicles and a set of customers with known pickup or delivery demands MVRPB determines a set of vehicle routes originating and ending at a single depot and visiting all customers exactly once. The objective is to minimize the total distance traversed with the least number of vehicles. For this problem, we propose an Ant Colony Optimization algorithm with a new visibility function which attempts to capture the “delivery” and “pickup” nature of the problem. Our numerical tests to compare the performance of the proposed approach with those of the well-known benchmark problems reveal that the proposed approach provides encouraging results
Ant colony optimization and its application to the vehicle routing problem with pickups and deliveries
Ant Colony Optimization (ACO) is a population-based metaheuristic that can be used to find approximate solutions to difficult optimization problems. It was first introduced for solving the Traveling Salesperson Problem. Since then many implementations of ACO have been proposed for a variety of combinatorial optimization. In this chapter, ACO is applied to the Vehicle Routing Problem with Pickup and Delivery (VRPPD). VRPPD determines a set of vehicle routes originating and ending at a single depot and visiting all customers exactly once. The vehicles are not only required to deliver goods but also to pick up some goods from the customers. The objective is to minimize the total distance traversed. The chapter first provides an overview of ACO approach and presents several implementations to various combinatorial optimization problems. Next, VRPPD is described and the related literature is reviewed, Then, an ACO approach for VRPPD is discussed. The approach proposes a new visibility function which attempts to capture the “delivery” and “pickup” nature of the problem. The performance of the approach is tested using well-known benchmark problems from the literature
Online Reinforcement Learning of X-Haul Content Delivery Mode in Fog Radio Access Networks
We consider a Fog Radio Access Network (F-RAN) with a Base Band Unit (BBU) in
the cloud and multiple cache-enabled enhanced Remote Radio Heads (eRRHs). The
system aims at delivering contents on demand with minimal average latency from
a time-varying library of popular contents. Information about uncached
requested files can be transferred from the cloud to the eRRHs by following
either backhaul or fronthaul modes. The backhaul mode transfers fractions of
the requested files, while the fronthaul mode transmits quantized baseband
samples as in Cloud-RAN (C-RAN). The backhaul mode allows the caches of the
eRRHs to be updated, which may lower future delivery latencies. In contrast,
the fronthaul mode enables cooperative C-RAN transmissions that may reduce the
current delivery latency. Taking into account the trade-off between current and
future delivery performance, this paper proposes an adaptive selection method
between the two delivery modes to minimize the long-term delivery latency.
Assuming an unknown and time-varying popularity model, the method is based on
model-free Reinforcement Learning (RL). Numerical results confirm the
effectiveness of the proposed RL scheme.Comment: 5 pages, 2 figure
- …