increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. crew costs are second only to fuel costs on the cost list of airline companies. so, this paper attempts to investigate the cockpit crew pairing problem. the set partitioning problem has been used for ...

In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource constraints (SPPRC) or one of its variants. This paper proposes a classification and a generic formulation for the SPPRCs, briefly discusses complex modeling issues involving resources, and presents the most commonly used SPPRC solution method...

The single vehicle routing problem with multiple routes is a variant of the vehicle routing problem where the vehicle can be dispatched to several routes during its workday to serve a number of customers. In this paper we propose a goal programming model for multi-objective single vehicle routing problem with time windows and multiple routes. To solve the model, we present a heuristic method wh...

The Shortest Path Problem with Resource Constraints is a common subproblem in many Branch-Cut-and-Price algorithms (BCP), e.g., routing and scheduling problems. This paper presents a general label-setting algorithm for solving various shortest path problems. An integration of the ‘Shortest Path Problem with Resource Constraints and k-cycle elimination’ with the ‘Partial Elementarity’ is introdu...

Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constraint filtering have been studied. We provide the first extensive experimental evaluation of the new algorithms in the context of the resource constrained shortest path problem. We show how reasoning about path-substructures in comb...

In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource constraints (SPPRC) or one of its variants. This chapter proposes a classification and a generic formulation for the SPPRCs, briefly discusses complex modeling issues involving resources, and presents the most commonly used SPPRC solution meth...

we design a two-stage scheme to consider trajectory planning problem of two mobile manipulators for cooperative transportation of a rigid body in presence of static obstacles. within the first stage, regarding the static obstacles we develop a method that searches the workspace for the shortest possible path between start and goal configurations by constructing a graph on a portion of the confi...

Abstract We introduce a variant of the Shortest Path Problem (SPP), in which we impose additional constraints on acceleration over arcs, and call it Bounded Acceleration SPP (BASP). This is inspired by an industrial application: vehicle needs to travel from its current position target one minimum-time, following pre-defined geometric paths connecting positions within facility, while satisfying ...