Search

Biomass has attracted considerable attention from both researchers and practitioners as an important renewable energy source that can help achieve sustainable development. However, inefficient biomass logistics systems hinder the development of biomass utilisation. This study investigates a two-echelon biomass resource location-routing problem (2E-BRLRP). Considering a predetermined supply of biomass resources, a mixed integer programming model for the 2E- BRLRP is established to determine the best locations for biomass collection facilities and corresponding vehicle routes. To address the computational complexity, a hybrid heuristic algorithm that embeds variable neighbourhood search into the tabu search framework is developed. A set of comprehensive computational examples are used to test the effectiveness and efficiency of the proposed approach. • This study investigates a two-echelon biomass resource location-routing problem. • A novel mixed integer programming model is established for the proposed problem. • A hybrid heuristic algorithm is developed for problem solution. • Comprehensive computational examples are conducted to verify the proposed approach. [ABSTRACT FROM AUTHOR]

This article explores the quay crane scheduling problem at an indented berth. The indented berth is known as an innovative implementation in the container terminals to tackle the challenge from the emergence of more and more mega-containerships. A mixed integer programming model by considering the non-crossing and safety distance constraints is formulated. A Tabu search heuristic is developed to solve the proposed problem. The computational results from this research indicate that the designed Tabu search is an effective method to handle the quay crane scheduling problem at an indented berth. [ABSTRACT FROM AUTHOR]

Abstract: This paper proposes a novel integrated model for yard truck and yard crane scheduling problems for loading operations in container terminal. The problem is formulated as a mixed-integer programming model. Due to the computational intractability, two efficient solution methods, based on Benders’ decomposition, are developed for problem solution; namely, the general Benders’ cut-based method and the combinatorial Benders’ cut-based method. Computational experiments are conducted to evaluate the effectiveness of the proposed solution methods. [Copyright &y& Elsevier]

Abstract: This paper discusses the quay crane scheduling problem at indented berth, an extension to the current quay crane scheduling problem in the field of container terminal operation. A mixed integer programming model by considering the unique features of the quay crane scheduling problem at indented berth is formulated. For solution, decomposition heuristic framework is developed and enhanced by Tabu search. To evaluate the performance of the proposed heuristic framework, a comprehensive numerical test is carried out and its results show the good quality of the proposed heuristic framework. [Copyright &y& Elsevier]