In this paper, the multiple travelling salesperson problem with hotel selection (m-TSPHS) is presented. This combinatorial optimisation problem is a generalisation of both the travelling salesperson problem with hotel selection (TSPHS) and the multiple travelling salesperson problem (m-TSP). As...

Stated choice experiments are conducted to identify the attributes that drive people's preferences when choosing between competing options of products or services. They are widely used in transportation in order to support the decision making of companies and governmental authorities. A large...

Distribution companies that serve a very large number of customers, courier companies for example, often partition the geographical region served by a depot into zones. Each zone is assigned to a single vehicle and each vehicle serves a single zone. An alternative approach is to partition the...

We present an effective scheduling heuristic for realistic production planning in a petrochemical blending plant? The considered model takes into account orders spanning a multi-product portfolio with multiple bills of materials per product, that need to be scheduled on shared production...

In this paper, a metaheuristic approach is presented to solve the Clustered Vehicle Routing Problem (CluVRP). The CluVRP, in which customers are grouped into predefi?ned clusters, can be seen as a generalisation of the classical Capacitated Vehicle Routing Problem (CVRP). When serving all these...

This paper proposes a variant of the well-known capacitated vehicle routing problem that models the routing of vehicles in the cash-in-transit industry by introducing a risk constraint. In the Risk-constrained Cash-in-Transit Vehicle Routing Problem (RCTVRP), the risk of being robbed, which is...

We consider a selective vehicle routing problem, in which customers belonging to di?fferent partners in a logistic coalition are served in a single logistic operation with multiple vehicles. Each partner determines a cost of non-delivery (CND) for each of its customers, and a central algorithm...

Distribution companies that serve a very large number of customers, courier companies for example, often partition the geographical region served by a depot into zones. Each zone is assigned to a single vehicle and each vehicle serves a single zone. An alternative approach is to partition the...

In this paper, a variable neighborhood search (VNS) algorithm is developed and analyzed that can generate fifth species counterpoint fragments. The existing species counterpoint rules are quantified and form the basis of the objective function used by the algorithm. The VNS developed in this...