Chapter 3

Given a set of production schedules, the LNS algorithm is called to solve the distribution
problem generating vehicle routes and departure times as depicted in the first box of Figure 3.7. As
a result, vehicle departure times (Sv) and customer delivery times are determined. These variables
serve as input in running the heuristic batching algorithm, which mainly comprises two steps shown
in the second and third box. In the second box, orders are sorted in a list (L) in ascending order
based on their temperature requirements and their due times (their corresponding vehicle departure
times). The list of sorted orders, L, represents the priority of orders for being grouped into batches.
The third box shows the grouping of orders into batches based on the consistency conditions in the
following way. The first order in L, order 2, is selected and removed from the list to form batch 1.
Then, considering the two combination conditions of the heuristic batching algorithm (see Section
3.4.1), the batching procedure combines consistent orders from the top of the list into batch 1. Next,
it generates a new batch (batch 2) which includes the first order that cannot be combined with batch
1, and combines the remaining consistent orders with this order with regard to the two combination
conditions. In the illustrated example, first the consistency of order 5 with order 2 is checked. Since
its processing time and temperature requirement are the same as of order 2, it is consistent with
order 2. Besides, its delivery and departure times are closer than 5 time units to those of order 2
(condition 1) and the aggregate load of the batch does not violate the oven capacity (condition 2).
Therefore, order 5 is removed from the list and added to batch 1. However, the remaining orders
cannot be combined with order 2. For example, order 4 cannot be added to batch 1 because its
delivery time is not closer than 5 time units to that of order 2 (condition 1 is violated). Therefore,
batch 2 is created for the first remaining order of the list, order 4. Later, order 7 cannot be added to
batch 2 because its temperature requirement is not the same as that of order 4. The algorithm
continues until all orders are grouped into a set of batches. In this small instance, the algorithm
reduces the number of items to be scheduled from 11 to 6.
Then, the production scheduling problem is solved for the generated batches such that each
batch is finished before its due date. (The due date of a batch is the departure time of the vehicle
that carries orders of that batch). As shown in Figure 3.7, lines 1 and 3 start later than line 2. This is
because the due dates of their batches allow them to postpone the production time to reduce the
time gap between the production and delivery times of orders. Finally, the resulting production
schedules are released into the distribution module as input for the next iteration, where the
production finishing times provide bounds on the vehicle departure times.

3.5 Numerical results

In this section, the proposed planning approach is evaluated through a number of numerical tests.
We developed a main test set consisting of 200 orders based on the real setting of the catering
company at hand. Three additional test sets are derived from the main set for testing the algorithm
on different problem sizes (see Section 3.5.1). To obtain problem instances, we modified Solomon’s
R201 test instance (Solomon, 1987) regarding customer locations and delivery durations. In case 1
and 2, Solomon’s R201 data are used by considering the first 50 and 100 orders. In case 3 and 4, the
first 100 orders from the second test instance are copied and location data are randomly generated
for the next 50 and 100 orders such that they locate in the defined area of the first 100 customers.

57