Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem

Juan, Ángel A.; Pascual, Inaki; Guimarans, Daniel; Barrios, Barry B.

doi:10.1111/itor.12101

Cited by 52 publications

(56 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, alternative algorithms, available in the literature, should be used, able to come up with very close to the optimal solutions with acceptable computational complexity [17]. In this work, we applied a meta-heuristic method [26], which has been shown to lead to high-quality solutions (the average gap is less than 1% with respect to best-known solutions) in almost real time. The applied method uses biased randomization together with an iterated local search meta-heuristic algorithm.…”

mentioning

confidence: 99%

Energy- and Spectrum-Efficient User Association in Millimeter-Wave Backhaul Small-Cell Networks

Mesοdiakaki¹,

Adelantado²,

Alonso³

et al. 2017

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Abstract-Macrocells are expected to be densely overlaid by small cells (SCs) to meet the increasing capacity demands. Due to their dense deployment, some SCs will not be connected directly to the core network and thus they may forward their traffic to the neighboring SCs until they reach it, thereby forming a multi-hop backhaul (BH) network. This is a promising solution, since the expected short length of BH links enables the use of millimeter wave (mmWave) frequencies to provide high capacity BH. In this context, user association becomes challenging due to the multihop BH architecture and therefore new optimal solutions should be developed. Thus, in this paper, we study the user association problem aiming at the joint maximization of network energy and spectrum efficiency, without compromising the user quality of service. The problem is formulated as an ε-constraint problem, which considers the transmit energy consumption both in the access network, i.e., the links between the users and their serving cells, and the BH links. The optimal Pareto front solutions of the problem are analytically derived for different BH technologies and insights are gained into the energy and spectrum efficiency trade-off. The proposed optimal solutions, despite their high complexity, can be used as a benchmark for the performance evaluation of user association algorithms. We also propose a heuristic algorithm, which is compared with reference solutions under different traffic distribution scenarios and BH technologies. Our results motivate the use of mmWave BH, while the proposed algorithm is shown to achieve near-optimal performance.

show abstract

mentioning

confidence: 99%

Energy- and Spectrum-Efficient User Association in Millimeter-Wave Backhaul Small-Cell Networks

Mesοdiakaki¹,

Adelantado²,

Alonso³

et al. 2017

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

show abstract

“…If higher probabilities of selection are assigned to the most promising movements during the constructive phase of the heuristic, the logic of the original procedure is respected. Indeed, asymmetric probability distributions, for instance, the geometric distribution or the decreasing triangular one, are preferred . Furthermore, if we execute it several times, we can obtain different solutions with similar costs.…”

Section: Solving Methodologymentioning

confidence: 99%

A 2‐stage biased‐randomized iterated local search for the uncapacitated single allocation p‐hub median problem

Fernandez

Ferone

Juan

et al. 2018

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

The hub location problem has gained attention over the last decades. In telecommunications network, a hub is a place of concurrence in where the work of the network is centralized with the purpose of delivering out the data that arrives from one or more directions to other destinations. There are different versions of the hub location problem depending upon (1) the existence or not of restrictions on the capacity related to the volume of flow a hub is allowed to support, (2) the existence or not of a set‐up cost associated with selecting any node as a hub, etc. In these types of configurations, the hubs serve as connection point between 2 installations, allowing, in this way, to replace a large amount of direct connections between all pair of the nodes, therefore, minimizing the total transportation cost of the network. Thus, this work proposes a 2‐stage metaheuristic based on the combination of biased‐randomized technique with an iterated local search framework for solving the uncapacitated single allocation p‐hub median problem, with computational results that validate the methodology for large‐size instances from the literature.

show abstract

“…(), and Juan et al. () are some recent works using them. The best known solutions (BKSs) have been extracted from these works.…”

Section: Computational Experimentsmentioning

confidence: 99%

Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands

Calvet

Wang²,

Juan

et al. 2018

Int Trans Operational Res

View full text Add to dashboard Cite

When capacity constraints have to be considered at each depot due to the existence of a limited number of capacitated vehicles, the multidepot vehicle routing problem (MDVRP) is a nontrivial extension of the well‐known capacitated vehicle routing problem (CVRP). The MDVRP combines a customer‐to‐depot assignment problem with several CVRPs. In real‐life scenarios, it is usual to find uncertainty in the customers' demands. There are few works on the stochastic MDVRP (SMDVRP) and, to the best of our knowledge, most of them assume the existence of an unlimited fleet of vehicles at each depot. This paper presents a simheuristic framework combining Monte Carlo simulation with a metaheuristic algorithm to deal with the SMDVRP with limited fleets (and, therefore, limited depot serving capacity). Its efficiency is tested on a set of stochastic instances, which extend the ones available in the literature for the deterministic version of the problem.

show abstract

Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem

Cited by 52 publications

References 36 publications

Energy- and Spectrum-Efficient User Association in Millimeter-Wave Backhaul Small-Cell Networks

Energy- and Spectrum-Efficient User Association in Millimeter-Wave Backhaul Small-Cell Networks

A 2‐stage biased‐randomized iterated local search for the uncapacitated single allocation p‐hub median problem

Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands

Contact Info

Product

Resources

About