|
|
|
|
|
Lei Zhang and Zhi Pei
In the present paper, the online valet driving problem (OVDP) is studied. In this problem, customers request a valet driving service through the platform, then the valets arrive on e-bikes at the designated pickup location and drive the vehicle to the de...
ver más
|
|
|
|
|
|
|
|
|
|
|
Daniela Ambrosino, Carmine Cerrone and Anna Sciomachen
This paper presents a new heuristic algorithm tailored to solve large instances of an NP-hard variant of the shortest path problem, denoted the cost-balanced path problem, recently proposed in the literature. The problem consists in finding the origin?de...
ver más
|
|
|
|
|
|
|
|
|
|
|
Umberto Junior Mele, Luca Maria Gambardella and Roberto Montemanni
Recent systems applying Machine Learning (ML) to solve the Traveling Salesman Problem (TSP) exhibit issues when they try to scale up to real case scenarios with several hundred vertices. The use of Candidate Lists (CLs) has been brought up to cope with t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Leandro do C. Martins, Christopher Bayliss, Pedro J. Copado-Méndez, Javier Panadero and Angel A. Juan
Advances in information and communication technologies have made possible the emergence of new shopping channels. The so-called ?omnichannel? retailing mode allows customers to shop for products online and receive them at home. This paper focuses on the ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dhananjay Thiruvady, Christian Blum and Andreas T. Ernst
Matheuristics have been gaining in popularity for solving combinatorial optimisation problems in recent years. This new class of hybrid method combines elements of both mathematical programming for intensification and metaheuristic searches for diversifi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Eduardo Salazar Hornig, Oscar Sánchez Pinto
En este trabajo se aplica un algoritmo de optimización de colonia de hormigas con límites de feromona superior e inferior denominado Max?Min Ant System, para resolver problemas de programación de una máquina con tiempos de preparación dependientes de la ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Felipe Tomás Muñoz Valdés, Reinaldo Javier Moraga Suazo
Este artículo presenta una heurística constructiva visionaria para resolver el problema de máquinas paralelas no relacionadas con tiempos de setup dependientes de la secuencia, donde el objetivo es minimizar el tiempo de completación del último trabajo, ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Romero, R.; Rocha, C.; Mantovani, J.R.S.; Sanchez, I.G.
Pág. 277 - 282
|
|
|
|
|
|