We consider a supply chain channel with two manufacturers and one retailer. Each manufacturer can choose either a wholesale price contract or a revenue-sharing contract with the retailer. We discuss and compare the results of two different types of contracts under different channel power...

This paper approximately solves the high school timetabling problem using a simulated annealing based algorithm with a newly-designed neighborhood structure. In search for the best neighbor, the heuristic performs a sequence of swaps between pairs of time slots, instead of swapping two...

This paper studies a version of stochastic vehicle routing problems, in which travel and service times are stochastic, and a time window constraint is associated with each customer. This problem is originally formulated as a chance constrained programming model and a stochastic programming model...

This paper addresses some of the challenges faced by a company which is responsible for delivering coal to its four subsidiaries situated along a river, through river hired or self-owned vessels. We propose to adopt a vendor managed inventory concept that involves establishment of a central...

The two-dimensional loading heterogeneous fleet vehicle routing problem (2L-HFVRP) is a variant of the classical vehicle routing problem in which customers are served by a heterogeneous fleet of vehicles. These vehicles have different capacities, fixed and variable operating costs, length and...

This paper presents a two-stage intelligent search algorithm for a two-dimensional strip packing problem without guillotine constraint. In the first stage, a heuristic algorithm is proposed, which is based on a simple scoring rule that selects one rectangle from all rectangles to be packed, for...