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...

As IC technology advances rapidly, the dimensions of packages and PCBs are decreasing while the pin counts and routing layers keep increasing. Today, a high-performance PCB usually contains thousands of pins and more than ten signal layers. Moreover, the manufacturing constraints require all nets to be routed in the planar fashion and the designer requires nets in the same bus to be routed toge...

This research is motivated by a real-life school bus routing problem (SBRP). In the Flemish region (Belgium), transport of children to their school is organized by the Flemish transportation company. Each pupil having the right to be transported to its school, also has the right to a bus stop located at a distance less than 750 metres from its residence. To efficiently design the routes, a set ...

The problem statement tackled in this paper is concentrated on the school bus routing problem (SBRP) in urban areas. This problem is a variant of the vehicle routing problem where we identify three simultaneous decisions that have to bemade: determining the set of stops to visit, for each student which stop he should walk to and the latter case occurs when determining the routes visited with th...

The school bus routing problem (SBRP) involves interrelated decisions such as selecting the stops, allocating students to selected and designing routes for transporting taking into account capacity constraint, with objective of minimizing cost routes. This paper addresses SBRP when reaction selection stops is taken account, that is, are allowed choose stop best suits them. A bilevel optimizatio...