Optimization of crane setup location and servicing schedule for urgent material requests with non-homogeneous and non-fixed material supply

Optimization of crane setup location and servicing schedule for urgent material requests with... Reducing hook movement distances could decrease crane operation times to deliver heavyweight materials in construction sites. Conventional scheduling methods include first-in-first-serve (FIFS), shortest-job-first (SJF), nearest-neighbor-first (NNF), and Traveling salesman problem (TSP). A new optimization model to optimize crane setup location, hook movement sequences and servicing schedules serving all supply and demand locations is proposed. Proposed model is able to model homogeneous and non-homogeneous material supply. Initial hook location can be given as input for optimization. Fixed material supply and demand location pairs are relaxed as model variables. Maximum crane lifting capacity is considered and multiple hook movement trips between material supply and demand locations are modeled if requested material weights exceed this maximum crane lifting capacity. Users may place “urgent” material demand requests and the proposed optimization model can optimize a servicing sequence to prioritize all urgent requests. The problem is formulated as a Binary-Mixed-Integer-Linear-Program (BMILP) which is solved by standard branch-and-bound techniques. Significant reduction in total operation time is achieved while comparing to other conventional scheduling strategies. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Automation in Construction Elsevier

Optimization of crane setup location and servicing schedule for urgent material requests with non-homogeneous and non-fixed material supply

Loading next page...
 
/lp/elsevier/optimization-of-crane-setup-location-and-servicing-schedule-for-urgent-ytwzI4ogpb
Publisher
Elsevier
Copyright
Copyright © 2018 Elsevier B.V.
ISSN
0926-5805
D.O.I.
10.1016/j.autcon.2018.01.015
Publisher site
See Article on Publisher Site

Abstract

Reducing hook movement distances could decrease crane operation times to deliver heavyweight materials in construction sites. Conventional scheduling methods include first-in-first-serve (FIFS), shortest-job-first (SJF), nearest-neighbor-first (NNF), and Traveling salesman problem (TSP). A new optimization model to optimize crane setup location, hook movement sequences and servicing schedules serving all supply and demand locations is proposed. Proposed model is able to model homogeneous and non-homogeneous material supply. Initial hook location can be given as input for optimization. Fixed material supply and demand location pairs are relaxed as model variables. Maximum crane lifting capacity is considered and multiple hook movement trips between material supply and demand locations are modeled if requested material weights exceed this maximum crane lifting capacity. Users may place “urgent” material demand requests and the proposed optimization model can optimize a servicing sequence to prioritize all urgent requests. The problem is formulated as a Binary-Mixed-Integer-Linear-Program (BMILP) which is solved by standard branch-and-bound techniques. Significant reduction in total operation time is achieved while comparing to other conventional scheduling strategies.

Journal

Automation in ConstructionElsevier

Published: May 1, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off