نتایج جستجو برای: quay crane

تعداد نتایج: 3776  

2008
E. Lefeber J. T. Udding

We consider a port consisting of a cluster of inter-related terminals, where container vessels arrive cyclically. The problem is to strategically assign a terminal and a time interval of berthing to each of the vessels in the cycle. Restricting properties are terminal quay lengths and quay crane capacity. Conflicting objectives are i) minimizing the number of required quay cranes, ii) minimizin...

Journal: :international journal of supply and operations management 2014
azza lajjam mohamed el merouani yassine tabaa abdellatif medouri

due to the considerable growth in the worldwide container transportation, optimization of container terminal operations is becoming highly needed to rationalize the use of logistics resources. for this reason, we focus our study on the quay crane scheduling problem (qcsp), which is a core task of managing maritime container terminals. from this planning problem arise two decisions to be made: t...

2012
Yi Ding TianYi Gu GuoLong Lin ChengJi Liang

The logistics operation of container terminal can be exploded into several subsystems which are correlative, these subsystems connect by some handling facilities. This paper study the coordinated scheduling of three main kinds of facilities-Quay Crane(QC),Yard Truck(YT) and Yard Crane(YC), use multidisciplinary variable coupling design optimization method(MVCDO) to build YT coordinated scheduli...

2015
Yun Fong LIM Yan ZHANG Chen WANG Yun Fong Lim

The main challenge for a container terminal is to maximize its throughput using limited resources subject to various operational constraints under uncertainty. Traditional methods try to achieve this through an optimized plan by solving a quay crane scheduling problem; but the plan may become obsolete or infeasible after shocks (changes in the system due to uncertainty). To respond to shocks th...

2009
Quang Hieu Ngo Keum-Shik Hong

In this paper, the skew control of the load (container) in the quay crane used in the dockside of a container terminal is investigated. The mathematical model of the 3-dimensional (3D) motions of the load is first derived. The container hooked to a spreader is suspended by four ropes in air. When the container is accelerated by the trolley or is disturbed by winds, it will make a rotational mot...

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...

2009
Giovanni Giallombardo Luigi Moccia Matteo Salani Ilaria Vacca

In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). We present two formulations: a mixed intege...

2012
Daniela Ambrosino Elena Tanfani

In this paper we focus our attention on the operational decision problems related to the seaside area of maritime container terminals. In particular, we face the Quay Crane Assignment Problem (QCAP) and Quay Crane Scheduling Problem (QCSP) with an integrated simulation-optimization approach. A 0/1 MIP model is developed in order to determine the optimal assignment, on a shift basis, of QCs to b...

Journal: :JCP 2012
Wenbin Hu Zhengbing Hu Lei Shi Peng Luo Wei Song

In order to reduce the conflict of yard, vehicles and quay crane in the process of loading container, and upgrade safety of the ship stowage and transport economics, this paper took minimizing reshuffle times in yard and ship, minimizing the ship center of gravity, getting appropriate trim and minimizing the total moving distance of quay crane as optimization objectives to guarantee the balance...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->