This paper addresses a special truck scheduling problem in the open-pit mine with different transport revenue consideration. A mixed integer programming model is formulated to define the problem clearly and a few valid inequalities are deduced to strengthen the model. Some properties and two upper bounds of the problem are proposed. Based on these inequalities, properties, and upper bounds, a heuristic solution approach with two improvement strategies is proposed to resolve the problem and the numerical experiment demonstrates that the proposed solution approach is effective and efficient.
No takes yet. Share an insight, caveat, or question.
Chang et al. (2015) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: