设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
Wiley电子期刊(1)
Springer电子图书(4)
SpringerLink电子期刊(35)
Elsevier电子期刊(63)
在“
Elsevier电子期刊
”中,
命中:
63
条,耗时:0.0509774 秒
在所有数据库中总计命中:
103
条
1.
A HPSO for solving dynamic and discrete
berth
allocation
problem
and dynamic quay crane assignment
problem
simultaneously
作者:
Hsien-Pin Hsu
;
hphsu@webmail.nkmu.edu.tw" class="auth_mail" title="E-mail the corresponding author
关键词:
Berth
allocation
problem
(BAP)
;
Quay crane assignment
problem
(QCAP)
;
Particle swarm optimization (PSO)
;
Genetic algorithm (GA)
刊名:Swarm and Evolutionary Computation
出版年:2016
2.
An adaptive large neighborhood search for the discrete and continuous
Berth
allocation
problem
作者:
Geraldo Regis Mauri
a
;
geraldo.mauri@ufes.br" class="auth_mail" title="E-mail the corresponding author
;
Glaydston Mattos Ribeiro
b
;
glaydston@pet.coppe.ufrj.br" class="auth_mail" title="E-mail the corresponding author
;
Luiz Antonio Nogueira Lorena
c
;
lorena@lac.inpe.br" class="auth_mail" title="E-mail the corresponding author
;
Gilbert Laporte
d
;
gilbert.laporte@cirrelt.ca" class="auth_mail" title="E-mail the corresponding author
关键词:
Berth
allocation
problem
;
Metaheuristic
;
Adaptive large neighborhood search
刊名:Computers and Operations Research
出版年:2016
3.
A Set-Partitioning-based model for the
Berth
Allocation
Problem
under Time-Dependent Limitations
作者:
Eduardo Lalla-Ruiz
;
elalla@ull.es" class="auth_mail" title="E-mail the corresponding author
;
Christopher Expó
;
sito-Izquierdo
cexposit@ull.es" class="auth_mail" title="E-mail the corresponding author
;
Belé
;
n Meliá
;
n-Batista
mbmelian@ull.es" class="auth_mail" title="E-mail the corresponding author
;
J. Marcos Moreno-Vega
jmmoreno@ull.es" class="auth_mail" title="E-mail the corresponding author
关键词:
Berth
Allocation
Problem
;
Set Partitioning
;
Optimization model
;
Maritime container terminal
刊名:European Journal of Operational Research
出版年:2016
4.
A robust optimization approach to the integrated
berth
allocation
and quay crane assignment
problem
作者:
Xiao Ting Shang
a
;
Jin Xin Cao
b
;
imucjx@163.com" class="auth_mail" title="E-mail the corresponding author
;
Jie Ren
a
关键词:
Berth
allocation
;
Quay crane assignment
;
Robust optimization
;
Price constraints
;
Genetic algorithm
;
Insertion heuristic algorithm
刊名:Transportation Research Part E: Logistics and Transportation Review
出版年:2016
5.
Behavior perception-based disruption models for
berth
allocation
and quay crane assignment
problem
s
作者:
Changchun Liu
a
;
051908lcc@163.com" class="auth_mail" title="E-mail the corresponding author
;
Li Zheng
a
;
lzheng@tsinghua.edu.cn" class="auth_mail" title="E-mail the corresponding author
;
Canrong Zhang
b
;
crzhang@sz.tsinghua.edu.cn" class="auth_mail" title="E-mail the corresponding author
关键词:
Container terminals
;
Berth
allocation
;
Quay crane assignment
problem
;
Disruption environment
;
Prospect theory
刊名:Computers & Industrial Engineering
出版年:2016
6.
Berth
allocation
in an ore terminal with demurrage, despatch and maintenance
作者:
Glaydston Mattos Ribeiro
a
;
glaydston@pet.coppe.ufrj.br" class="auth_mail" title="E-mail the corresponding author
;
Geraldo Regis Mauri
b
;
geraldo.mauri@ufes.br" class="auth_mail" title="E-mail the corresponding author
;
Saulo de Castro Beluco
c
;
saulobeluco@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Luiz Antonio Nogueira Lorena
d
;
lorena@lac.inpe.br" class="auth_mail" title="E-mail the corresponding author
;
Gilbert Laporte
e
;
gilbert.laporte@cirrelt.ca" class="auth_mail" title="E-mail the corresponding author
关键词:
Berth
allocation
problem
;
Brazilian port
;
Solid bulk
;
Adaptive large neighborhood search
刊名:Computers & Industrial Engineering
出版年:2016
7.
Functional integration approach for the
berth
allocation
, quay crane assignment and specific quay crane assignment
problem
s
作者:
A. Karam
a
;
b
;
ahmed.mostafa@ejust.edu.eg
;
ahmed.mustafa@feng.bu.edu.eg
;
A.B. Eltawil
b
关键词:
Berth
allocation
;
Quay crane assignment
;
Container terminal
;
Functional integration
刊名:Computers & Industrial Engineering
出版年:2016
8.
Optimal policies for the
berth
allocation
problem
under stochastic nature
作者:
Evrim Ursavas
e.ursavas@rug.nl" class="auth_mail" title="E-mail the corresponding author
;
Stuart X. Zhu
;
x.zhu@rug.nl" class="auth_mail" title="E-mail the corresponding author
关键词:
Pricing
;
Inventory
;
Return and expediting
;
Stochastic dynamic programing
;
Optimization
刊名:European Journal of Operational Research
出版年:2016
9.
Multi-objective genetic algorithm for
berth
allocation
problem
considering daytime preference
作者:
Zhi-Hua Hu
;
zhhu@shmtu.edu.cn" class="auth_mail" title="E-mail the corresponding author
关键词:
Berth
allocation
problem
;
Dynamic discrete
berth
allocation
problem
;
Shiftwork
;
Multi-objective genetic algorithm
;
Maritime terminal
刊名:Computers & Industrial Engineering
出版年:2015
10.
Optimal
berth
allocation
, time-variant quay crane assignment and scheduling with crane setups in container terminals
作者:
Yavuz B. Tü
;
rkoğulları
a
;
yavuz.turkogullari@maltepe.edu.tr" class="auth_mail" title="E-mail the corresponding author
;
Z. Caner Taşkın
;
b
;
caner.taskin@boun.edu.tr" class="auth_mail" title="E-mail the corresponding author
;
Necati Aras
b
;
arasn@boun.edu.tr" class="auth_mail" title="E-mail the corresponding author
;
İ. Kuban Altınel
b
;
altinel@boun.edu.tr" class="auth_mail" title="E-mail the corresponding author
关键词:
Integer programming
;
Container terminal management
;
Berth
allocation
;
Crane assignment
;
Crane scheduling
刊名:European Journal of Operational Research
出版年:2016
1
2
3
4
5
6
7
按检索点细分(63)
题名(28)
关键词(20)
文摘(55)
按出版年细分(63)
2027年及以后(4)
2016年(12)
2015年(1)
2013年(4)
2012年(8)
2011年(7)
2010年(4)
2009年(3)
2008年(6)
2007年(3)
2005年(2)
2003年(3)
2002年(1)
2001年(3)
2000年及以前(2)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.