capacity planning for a coal chain

We study a capacity alignment planning problem for a coal chain. given a set of train operators, a set of train paths, and a terminal comprising of a dump station and a set of routes from the dump station to the stockyard, we seek a feasible assignment of train operators to train paths, to time slots at the dump station, and to routes. the assignment must maximize the number of system paths in the resulting schedule and the schedule should perform well with respect to various performance criteria. we model the problem as a mixed-integer conic program (micp) with multiple objectives which we solve using a hierarchical optimization procedure. in each stage of this procedure we solve a single objective micp. depending upon whether we evaluate the associated performance criteria under a 2- or 1-norm we reformulate the micp as either a mixed-integer second-order cone program or as a mixed-integer linear program respectively and can streamline the hierarchical optimization procedure by exploiting properties of the model or observed behavior on practical instances. we compare the performance of the procedure under the different norms on a real instance of the problem and find that the quality of the solutions found by the faster 1-norm procedure compare well to the solution found under the 2-norm.