Showing 1 - 10 of 101
In this paper, an algorithm, called ACS-OPHS, is proposed to tackle the Orienteering Problem with Hotel Selection (OPHS). This algorithm is strongly based on the Ant Colony System (ACS); however, it differs from the ACS in the way the paths are constructed, in tuning a parameter of the...
Persistent link: https://www.econbiz.de/10012514354
This paper formulates a team orienteering problem with multiple fixed-wing drones and develops a branch-and-price algorithm to solve the problem to optimality. Fixed-wing drones, unlike rotary drones, have kinematic constraints associated with them, thereby preventing them to make on-the-spot...
Persistent link: https://www.econbiz.de/10013502472
Collaborative delivery employing drones in last-mile delivery has been an extensively studied topic in recent years. In this paper, it is studied Truck–Drone Delivery Problems (TDDPs) in which a traditional delivery truck is gathered with a drone to cut delivery times and costs. The vehicles...
Persistent link: https://www.econbiz.de/10014518050
Persistent link: https://www.econbiz.de/10011708945
In this paper, we study an extension of the orienteering problem where travel times are random and time-dependent and service times are random. Additionally, the service at each selected customer is subject to a soft time window; that is, violation of the window is allowed but subject to a...
Persistent link: https://www.econbiz.de/10014518059
In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the depot over time, during the planning horizon. The time...
Persistent link: https://www.econbiz.de/10014518066
Persistent link: https://www.econbiz.de/10011618594
scarce and usually either relies on heuristics or only considers restrictive fare models that are too limited to cover the …
Persistent link: https://www.econbiz.de/10015193397
We present a Variable Neighborhood Search heuristic for the rolling stock rescheduling problem. Rolling stock rescheduling is needed when a disruption leads to cancellations in the timetable. In rolling stock rescheduling, one must then assign duties, i.e., sequences of trips, to the available...
Persistent link: https://www.econbiz.de/10012514368
Due to the increasing price pressure in the less-than-truckload (LTL) market, horizontal cooperation is an effective and efficient way for small- and medium-sized LTL carriers to enhance their profits by exchanging requests. For this purpose, a decentralized auction-based collaboration framework...
Persistent link: https://www.econbiz.de/10013502626