3 papers
cs.NE2020
A Non-Dominated Sorting Based Customized Random-Key Genetic Algorithm for the Bi-Objective Traveling Thief Problem
Jonatas B. C. Chagas, Julian Blank, Markus Wagner +2
In this paper, we propose a method to solve a bi-objective variant of the well-studied Traveling Thief Problem (TTP). The TTP is a multi-component problem that combines two classic…
cs.AI2019
The double traveling salesman problem with partial last-in-first-out loading constraints
Jonatas B. C. Chagas, Túlio A. M. Toffolo, Marcone J. F. Souza +1
In this paper, we introduce the Double Traveling Salesman Problem with Partial Last-In-First-Out Loading Constraints (DTSPPL). It is a pickup-and-delivery single-vehicle routing pr…
cs.AI2018
Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads
Matheus Nohra Haddad, Rafael Martinelli, Thibaut Vidal +4
We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike…