Abstract This paper addresses a school bus routing problem formulated as capacitated and time-constrained open vehicle with heterogeneous fleet single loads. incorporates several realistic features, such student eligibility, maximum walking distances, stop selection, riding times, different types of buses, multistops, dwell times. A heuristic algorithm based on an iterated local search approach...

To schedule aircraft, assignments of fleet types to flights and aircraft routes must be determined. The former is known as the assignment problem while latter routing in literature. Aircraft usually addressed a feasibility whose solution needed for constructing crew schedules. These problems are solved from 4 6 months before day operations. Therefore, there limited information regarding each ai...

An optimization method for condition based maintenance (CBM) of aircraft fleet considering prognostics uncertainty is proposed. The CBM and dispatch process of aircraft fleet is analyzed first, and the alternative strategy sets for single aircraft are given. Then, the optimization problem of fleet CBM with lower maintenance cost and dispatch risk is translated to the combinatorial optimization ...

In this paper, we propose a new routing problem to model a highly relevant planning task in small package shipping. We consider the Prize-Collecting Vehicle Routing Problem with Non-Linear cost (PCVRPNL) in its single and multi-depot version, which integrates the option of outsourcing customers to subcontractors instead of serving them with the private fleet. Thereby, a lower bound on the total...

This paper proposes a sequential optimisation approach for addressing complex real world problem of dispatch planning and freight loading set highly irregular products with heterogeneous fleet trucks. The focuses on the case goods 'low-density values', varied large travel distances. proposed is based two-phase strategy: first optimises space assignment process inside trucks to each type product...

in this paper we present the problem of designing a three level hub center network. in our network, the top level consists of a complete network where a direct link is between all central hubs.  the second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. we model this problem in an incomplete net...

With greater availability of real-time information systems, algorithms are needed to support commercial fleet operators in their decisions to assign vehicles and drivers to loads in a dynamic environment. We present a rolling horizon framework for the dynamic assignment and sequencing of trucks to jobs consisting of picking up and delivering full truckloads when requests for Submitted for prese...

This paper describes a tabu search heuristic for a vehicle routing problem where the owner of a private fleet can either visit a customer with one of his vehicles or assign the customer to a common carrier. The owner's objective is to minimize the variable and fixed costs for operating his fleet plus the total costs charged by the common carrier. The proposed tabu search is shown to outperform ...

Abstract In the classic Vehicle Routing Problem (VRP) a fleet of of vehicles has to visit a set of customers while minimising the operations’ costs. We study a rich variant of the VRP featuring split deliveries, an heterogeneous fleet, and vehiclecommodity incompatibility constraints. Our goal is twofold: define the cheapest routing and the most adequate fleet. To do so, we split the problem in...

This paper presents a model to coordinate the pricing and fleet management decisions of a freight carrier. We consider a setting where the loads faced by the carrier over a certain time horizon are deterministic functions of the prices. We want to find what prices the carrier should charge so that its pricing and fleet management decisions jointly maximize the profits. Our solution approach is ...