The Experts below are selected from a list of 4722 Experts worldwide ranked by ideXlab platform
Akio Imai - One of the best experts on this subject based on the ideXlab platform.
-
the simultaneous berth and quay crane allocation problem
Transportation Research Part E-logistics and Transportation Review, 2008Co-Authors: Akio Imai, Hsieh Chia Che, Etsuko Nishimura, Stratos PapadimitriouAbstract:This paper addresses efficient berth and crane allocation scheduling at a multi-User Container terminal. First, we introduce a formulation for the simultaneous berth and crane allocation problem. Next, by employing genetic algorithm we develop a heuristic to find an approximate solution for the problem. The fitness value of a chromosome is obtained by crane transfer scheduling across berths, which is determined by a maximum flow problem-based algorithm based on a berth allocation problem solution defined by the chromosome. The results of numerical experiments show that the proposed heuristic is applicable to solve this difficult but essential terminal operation problem.
-
Berthing ships at a multi-User Container terminal with a limited quay capacity
Transportation Research Part E: Logistics and Transportation Review, 2008Co-Authors: Akio Imai, Etsuko Nishimura, Stratos PapadimitriouAbstract:This paper addresses a variation of the berth allocation problem at multi-User terminals, as ships which would normally be served at the terminal but their expected wait time exceeds the time limit, are assigned to an external terminal. The objective of the problem is to minimize the total service time of ships at the external terminal. A genetic algorithm based heuristic is developed and a wide variety of numerical experiments showed that the heuristic developed performed well in reducing external terminal usage and thus may be helpful in the efficient management of busy ports during extreme peaking conditions.
-
Berth Allocation at Indented Berths for Mega-Containerships
European Journal of Operational Research, 2007Co-Authors: Akio Imai, Etsuko Nishimura, Masahiro Hattori, Stratos PapadimitriouAbstract:This paper addresses the berth allocation problem at a multi-User Container terminal with indented berths for fast handling of mega-Containerships. In a previous research conducted by the authors, the berth allocation problem at a conventional form of the multi-User terminal was formulated as a nonlinear mathematical programming, where more than one ship are allowed to be moored at a specific berth if the berth and ship lengths restriction is satisfied. In this paper, we first construct a new integer linear programming formulation for easier calculation and then the formulation is extended to model the berth allocation problem at a terminal with indented berths, where both mega-Containerships and feeder ships are to be served for higher berth productivity. The berth allocation problem at the indented berths is solved by genetic algorithms. A wide variety of numerical experiments were conducted and interesting findings were explored.
-
berth allocation in a Container port using a continuous location space approach
Transportation Research Part B-methodological, 2005Co-Authors: Akio Imai, Etsuko Nishimura, Xin Sun, Stratos PapadimitriouAbstract:This paper addresses the berth allocation problem in a multi-User Container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous papers, the authors have developed and presented the discrete location version of the berth allocation problem. In view of the steadily growing trend in increasing the Container ship size, more flexible berth allocation planning is mandatory, especially in busy hub ports where ships of various sizes are calling. In this paper, a heuristic for the berth allocation problem in continuous locations is presented. A wide variety of experiments were conducted and the results showed that the heuristic works well from a practical point of view.
-
Berth allocation with service priority
Transportation Research Part B: Methodological, 2003Co-Authors: Akio Imai, Etsuko Nishimura, Stratos PapadimitriouAbstract:Over the past several years, port related charges in Japanese ports have been substantially higher than those charged in other major international hub ports. All major Container ports in Japan feature so-called Dedicated Terminals in which cost-effectiveness is justified by huge Container volume to be handled. One of the reasons cited for high port charges is a relative decrease in handling volume compared to the terminal capacity, resulting in inefficient use of the existing capacity. The use of the Multi-User Container Terminal (MUT) concept employed in some of the major Container hub ports such as Hong Kong, Pusan, Hamburg and Rotterdam reduces redundant terminal space and results in substantial cost savings in cargo handling costs and therefore is desired for ports in Japan as well. One of the key issues in the MUT operation is the berth allocation to calling vessels. In a recent study, an allocation problem for the MUT was examined, in which each vessel was treated equally. However, as some vessel operators desire high priority services, the goal of this paper is to modify the existing formulation of the berth allocation problem in order to treat calling vessels at various service priorities by developing a genetic algorithm based heuristic for the resulting non-linear problem.
Stratos Papadimitriou - One of the best experts on this subject based on the ideXlab platform.
-
the simultaneous berth and quay crane allocation problem
Transportation Research Part E-logistics and Transportation Review, 2008Co-Authors: Akio Imai, Hsieh Chia Che, Etsuko Nishimura, Stratos PapadimitriouAbstract:This paper addresses efficient berth and crane allocation scheduling at a multi-User Container terminal. First, we introduce a formulation for the simultaneous berth and crane allocation problem. Next, by employing genetic algorithm we develop a heuristic to find an approximate solution for the problem. The fitness value of a chromosome is obtained by crane transfer scheduling across berths, which is determined by a maximum flow problem-based algorithm based on a berth allocation problem solution defined by the chromosome. The results of numerical experiments show that the proposed heuristic is applicable to solve this difficult but essential terminal operation problem.
-
Berthing ships at a multi-User Container terminal with a limited quay capacity
Transportation Research Part E: Logistics and Transportation Review, 2008Co-Authors: Akio Imai, Etsuko Nishimura, Stratos PapadimitriouAbstract:This paper addresses a variation of the berth allocation problem at multi-User terminals, as ships which would normally be served at the terminal but their expected wait time exceeds the time limit, are assigned to an external terminal. The objective of the problem is to minimize the total service time of ships at the external terminal. A genetic algorithm based heuristic is developed and a wide variety of numerical experiments showed that the heuristic developed performed well in reducing external terminal usage and thus may be helpful in the efficient management of busy ports during extreme peaking conditions.
-
Berth Allocation at Indented Berths for Mega-Containerships
European Journal of Operational Research, 2007Co-Authors: Akio Imai, Etsuko Nishimura, Masahiro Hattori, Stratos PapadimitriouAbstract:This paper addresses the berth allocation problem at a multi-User Container terminal with indented berths for fast handling of mega-Containerships. In a previous research conducted by the authors, the berth allocation problem at a conventional form of the multi-User terminal was formulated as a nonlinear mathematical programming, where more than one ship are allowed to be moored at a specific berth if the berth and ship lengths restriction is satisfied. In this paper, we first construct a new integer linear programming formulation for easier calculation and then the formulation is extended to model the berth allocation problem at a terminal with indented berths, where both mega-Containerships and feeder ships are to be served for higher berth productivity. The berth allocation problem at the indented berths is solved by genetic algorithms. A wide variety of numerical experiments were conducted and interesting findings were explored.
-
berth allocation in a Container port using a continuous location space approach
Transportation Research Part B-methodological, 2005Co-Authors: Akio Imai, Etsuko Nishimura, Xin Sun, Stratos PapadimitriouAbstract:This paper addresses the berth allocation problem in a multi-User Container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous papers, the authors have developed and presented the discrete location version of the berth allocation problem. In view of the steadily growing trend in increasing the Container ship size, more flexible berth allocation planning is mandatory, especially in busy hub ports where ships of various sizes are calling. In this paper, a heuristic for the berth allocation problem in continuous locations is presented. A wide variety of experiments were conducted and the results showed that the heuristic works well from a practical point of view.
-
Berth allocation with service priority
Transportation Research Part B: Methodological, 2003Co-Authors: Akio Imai, Etsuko Nishimura, Stratos PapadimitriouAbstract:Over the past several years, port related charges in Japanese ports have been substantially higher than those charged in other major international hub ports. All major Container ports in Japan feature so-called Dedicated Terminals in which cost-effectiveness is justified by huge Container volume to be handled. One of the reasons cited for high port charges is a relative decrease in handling volume compared to the terminal capacity, resulting in inefficient use of the existing capacity. The use of the Multi-User Container Terminal (MUT) concept employed in some of the major Container hub ports such as Hong Kong, Pusan, Hamburg and Rotterdam reduces redundant terminal space and results in substantial cost savings in cargo handling costs and therefore is desired for ports in Japan as well. One of the key issues in the MUT operation is the berth allocation to calling vessels. In a recent study, an allocation problem for the MUT was examined, in which each vessel was treated equally. However, as some vessel operators desire high priority services, the goal of this paper is to modify the existing formulation of the berth allocation problem in order to treat calling vessels at various service priorities by developing a genetic algorithm based heuristic for the resulting non-linear problem.
Etsuko Nishimura - One of the best experts on this subject based on the ideXlab platform.
-
the simultaneous berth and quay crane allocation problem
Transportation Research Part E-logistics and Transportation Review, 2008Co-Authors: Akio Imai, Hsieh Chia Che, Etsuko Nishimura, Stratos PapadimitriouAbstract:This paper addresses efficient berth and crane allocation scheduling at a multi-User Container terminal. First, we introduce a formulation for the simultaneous berth and crane allocation problem. Next, by employing genetic algorithm we develop a heuristic to find an approximate solution for the problem. The fitness value of a chromosome is obtained by crane transfer scheduling across berths, which is determined by a maximum flow problem-based algorithm based on a berth allocation problem solution defined by the chromosome. The results of numerical experiments show that the proposed heuristic is applicable to solve this difficult but essential terminal operation problem.
-
Berthing ships at a multi-User Container terminal with a limited quay capacity
Transportation Research Part E: Logistics and Transportation Review, 2008Co-Authors: Akio Imai, Etsuko Nishimura, Stratos PapadimitriouAbstract:This paper addresses a variation of the berth allocation problem at multi-User terminals, as ships which would normally be served at the terminal but their expected wait time exceeds the time limit, are assigned to an external terminal. The objective of the problem is to minimize the total service time of ships at the external terminal. A genetic algorithm based heuristic is developed and a wide variety of numerical experiments showed that the heuristic developed performed well in reducing external terminal usage and thus may be helpful in the efficient management of busy ports during extreme peaking conditions.
-
Berth Allocation at Indented Berths for Mega-Containerships
European Journal of Operational Research, 2007Co-Authors: Akio Imai, Etsuko Nishimura, Masahiro Hattori, Stratos PapadimitriouAbstract:This paper addresses the berth allocation problem at a multi-User Container terminal with indented berths for fast handling of mega-Containerships. In a previous research conducted by the authors, the berth allocation problem at a conventional form of the multi-User terminal was formulated as a nonlinear mathematical programming, where more than one ship are allowed to be moored at a specific berth if the berth and ship lengths restriction is satisfied. In this paper, we first construct a new integer linear programming formulation for easier calculation and then the formulation is extended to model the berth allocation problem at a terminal with indented berths, where both mega-Containerships and feeder ships are to be served for higher berth productivity. The berth allocation problem at the indented berths is solved by genetic algorithms. A wide variety of numerical experiments were conducted and interesting findings were explored.
-
berth allocation in a Container port using a continuous location space approach
Transportation Research Part B-methodological, 2005Co-Authors: Akio Imai, Etsuko Nishimura, Xin Sun, Stratos PapadimitriouAbstract:This paper addresses the berth allocation problem in a multi-User Container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous papers, the authors have developed and presented the discrete location version of the berth allocation problem. In view of the steadily growing trend in increasing the Container ship size, more flexible berth allocation planning is mandatory, especially in busy hub ports where ships of various sizes are calling. In this paper, a heuristic for the berth allocation problem in continuous locations is presented. A wide variety of experiments were conducted and the results showed that the heuristic works well from a practical point of view.
-
Berth allocation with service priority
Transportation Research Part B: Methodological, 2003Co-Authors: Akio Imai, Etsuko Nishimura, Stratos PapadimitriouAbstract:Over the past several years, port related charges in Japanese ports have been substantially higher than those charged in other major international hub ports. All major Container ports in Japan feature so-called Dedicated Terminals in which cost-effectiveness is justified by huge Container volume to be handled. One of the reasons cited for high port charges is a relative decrease in handling volume compared to the terminal capacity, resulting in inefficient use of the existing capacity. The use of the Multi-User Container Terminal (MUT) concept employed in some of the major Container hub ports such as Hong Kong, Pusan, Hamburg and Rotterdam reduces redundant terminal space and results in substantial cost savings in cargo handling costs and therefore is desired for ports in Japan as well. One of the key issues in the MUT operation is the berth allocation to calling vessels. In a recent study, an allocation problem for the MUT was examined, in which each vessel was treated equally. However, as some vessel operators desire high priority services, the goal of this paper is to modify the existing formulation of the berth allocation problem in order to treat calling vessels at various service priorities by developing a genetic algorithm based heuristic for the resulting non-linear problem.
Roger Howard - One of the best experts on this subject based on the ideXlab platform.
-
PILE DRIVING INDICATOR PROGRAM RESULTS, PIER 400 Container WHARF, PORT OF LOS ANGELES, CALIFORNIA
Geotechnical Engineering for Transportation Projects, 2004Co-Authors: Roger Howard, James Schneider, Tom Mcneilan, Philip RobinsAbstract:The largest single-User Container terminal in North America was recently constructed on Pier 400 at the Port of Los Angeles. The terminal's 2,250-meter long wharf is supported by about 3,700 24-inch octagonal precast, prestressed concrete piles. The piles are about 35-meters long and were driven through between 3 and 16 meters of rock dike. A total of 55 piles were monitored during two indicator pile-driving programs to develop the appropriate pile driving criteria to obtain the required axial pile capacity. The pile driving indicator programs include: (1) data from two different size diesel hammers and one hydraulic hammer; (2) comparison of piles driven dry versus those driven with jetting; and (3) restrike data after several days, several weeks, and several months. The results of the indicator pile programs provide the opportunity to better appreciate: (1) the impacts on capacity and schedule, when the piles are jetted; (2) the validity of using short-term restrikes to evaluate the ultimate long-term capacity of the piles; and (3) the potential economic, schedule, and quality control advantages that can be obtained when a hydraulic hammer is used.
-
Pier 400 Container Wharf Indicator Pile Driving Program Results, Port of Los Angeles, California
Ports 2004, 2004Co-Authors: Tom Mcneilan, James Schneider, Philip Robins, Roger HowardAbstract:The largest single-User Container terminal in North America was recently constructed on Pier 400 at the Port of Los Angeles. The terminal's 2,250-meter-long wharf is supported by about 3,700 610-millimeter (mm) octagonal, precast, prestressed concrete piles. The 35- to 40-meter-long piles were driven through between 3 and 18 meters of rock dike. Sixty-six piles were monitored during indicator pile driving programs. The indicator pile driving programs included: 1) data from two different-size diesel hammers and one hydraulic hammer; 2) comparison of piles driven dry vs. those driven with jetting; and 3) restrike data after several days, several weeks, and several months. The indicator pile program results illustrate: 1) the impacts on capacity and schedule when the piles are jetted; 2) the validity of using short-term restrikes to evaluate the ultimate long-term capacity of the piles; and 3) the potential economic, schedule, and quality-control advantages provided by a hydraulic hammer.
Philip Robins - One of the best experts on this subject based on the ideXlab platform.
-
PILE DRIVING INDICATOR PROGRAM RESULTS, PIER 400 Container WHARF, PORT OF LOS ANGELES, CALIFORNIA
Geotechnical Engineering for Transportation Projects, 2004Co-Authors: Roger Howard, James Schneider, Tom Mcneilan, Philip RobinsAbstract:The largest single-User Container terminal in North America was recently constructed on Pier 400 at the Port of Los Angeles. The terminal's 2,250-meter long wharf is supported by about 3,700 24-inch octagonal precast, prestressed concrete piles. The piles are about 35-meters long and were driven through between 3 and 16 meters of rock dike. A total of 55 piles were monitored during two indicator pile-driving programs to develop the appropriate pile driving criteria to obtain the required axial pile capacity. The pile driving indicator programs include: (1) data from two different size diesel hammers and one hydraulic hammer; (2) comparison of piles driven dry versus those driven with jetting; and (3) restrike data after several days, several weeks, and several months. The results of the indicator pile programs provide the opportunity to better appreciate: (1) the impacts on capacity and schedule, when the piles are jetted; (2) the validity of using short-term restrikes to evaluate the ultimate long-term capacity of the piles; and (3) the potential economic, schedule, and quality control advantages that can be obtained when a hydraulic hammer is used.
-
Pier 400 Container Wharf Indicator Pile Driving Program Results, Port of Los Angeles, California
Ports 2004, 2004Co-Authors: Tom Mcneilan, James Schneider, Philip Robins, Roger HowardAbstract:The largest single-User Container terminal in North America was recently constructed on Pier 400 at the Port of Los Angeles. The terminal's 2,250-meter-long wharf is supported by about 3,700 610-millimeter (mm) octagonal, precast, prestressed concrete piles. The 35- to 40-meter-long piles were driven through between 3 and 18 meters of rock dike. Sixty-six piles were monitored during indicator pile driving programs. The indicator pile driving programs included: 1) data from two different-size diesel hammers and one hydraulic hammer; 2) comparison of piles driven dry vs. those driven with jetting; and 3) restrike data after several days, several weeks, and several months. The indicator pile program results illustrate: 1) the impacts on capacity and schedule when the piles are jetted; 2) the validity of using short-term restrikes to evaluate the ultimate long-term capacity of the piles; and 3) the potential economic, schedule, and quality-control advantages provided by a hydraulic hammer.
