On the usage of Lagrangean Relaxation for the convoy movement problem

The problem of routing military convoys between specific origin and destination pairs is known as convoy movement problem (CMP). In this study, we consider an existing mathematical model of CMP and propose a lower bounding procedure based on Lagrangean Relaxation. The robustness of the proposed proc...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of the Operational Research Society 2011-04, Vol.62 (4), p.722-728
Main Authors: Ram Kumar, P N, Narendran, T T
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Business and Management
conflicts
Exact sciences and technology
Heuristics
Integer programming
Lagrange multipliers
Lagrangean Relaxation
Lagrangian function
Logistics
Management
Mathematics
military convoys
Militia movements
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimal solutions
Origin and destination
Roads & highways
scheduling
Theoretical Paper
Theoretical Papers
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c451t-e5f139fbb0b7df05554a40535a8ad611677854b9c5e1d206233cc7bde2d9d1823
cites cdi_FETCH-LOGICAL-c451t-e5f139fbb0b7df05554a40535a8ad611677854b9c5e1d206233cc7bde2d9d1823
container_end_page 728
container_issue 4
container_start_page 722
container_title The Journal of the Operational Research Society
container_volume 62
creator Ram Kumar, P N
Narendran, T T
description The problem of routing military convoys between specific origin and destination pairs is known as convoy movement problem (CMP). In this study, we consider an existing mathematical model of CMP and propose a lower bounding procedure based on Lagrangean Relaxation. The robustness of the proposed procedure is evaluated on a variety of test problem instances. Encouraging results are obtained.
doi_str_mv 10.1057/jors.2010.4
format article
fullrecord <record><control><sourceid>jstor_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1057_jors_2010_4</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>41059130</jstor_id><sourcerecordid>41059130</sourcerecordid><originalsourceid>FETCH-LOGICAL-c451t-e5f139fbb0b7df05554a40535a8ad611677854b9c5e1d206233cc7bde2d9d1823</originalsourceid><addsrcrecordid>eNptkN1LwzAUxYMoOKdPPotF8Ek7b5KmbR5lzA8YDESfQ9qms6NNNGmn--9N7Zwve7pczu-ekxyEzjFMMLDkbmWsmxDwa3SARjhK4pDTGA7RCHAMIYtTcoxOnFsBAAfMR2i20EH7roLOyaUKTBnM5dJKvVRSBy-qlt-yrYwOSmN_sdzotdkEjVmrRuk2-LAmq1Vzio5KWTt1tp1j9PYwe50-hfPF4_P0fh7mEcNtqFiJKS-zDLKkKIExFskIGGUylUWMcZwkKYsynjOFCwIxoTTPk6xQpOAFTgkdo6vB1-d-dsq1YmU6q32k8IeccAqph24GKLfGOatK8WGrRtqNwCD6mkRfk-hrEpGnr7eW0uWyLv3n88rtTgjlFBPaR98OnPOS78f-R--3vRxwLdvOqp1fz_RIT1wMxMq1xu6AyFtxTMHr8aBX2rffyC9j60K0clMb-_dKui_6B534nbY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>854929308</pqid></control><display><type>article</type><title>On the usage of Lagrangean Relaxation for the convoy movement problem</title><source>ABI/INFORM Collection</source><source>JSTOR Archival Journals and Primary Sources Collection【Remote access available】</source><source>Taylor and Francis Science and Technology Collection</source><creator>Ram Kumar, P N ; Narendran, T T</creator><creatorcontrib>Ram Kumar, P N ; Narendran, T T</creatorcontrib><description>The problem of routing military convoys between specific origin and destination pairs is known as convoy movement problem (CMP). In this study, we consider an existing mathematical model of CMP and propose a lower bounding procedure based on Lagrangean Relaxation. The robustness of the proposed procedure is evaluated on a variety of test problem instances. Encouraging results are obtained.</description><identifier>ISSN: 0160-5682</identifier><identifier>EISSN: 1476-9360</identifier><identifier>DOI: 10.1057/jors.2010.4</identifier><identifier>CODEN: JORSDZ</identifier><language>eng</language><publisher>London: Taylor &amp; Francis</publisher><subject>Algorithms ; Applied sciences ; Business and Management ; conflicts ; Exact sciences and technology ; Heuristics ; Integer programming ; Lagrange multipliers ; Lagrangean Relaxation ; Lagrangian function ; Logistics ; Management ; Mathematics ; military convoys ; Militia movements ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Operations Research/Decision Theory ; Optimal solutions ; Origin and destination ; Roads &amp; highways ; scheduling ; Theoretical Paper ; Theoretical Papers</subject><ispartof>The Journal of the Operational Research Society, 2011-04, Vol.62 (4), p.722-728</ispartof><rights>Copyright © 2010, Operational Research Society 2010</rights><rights>Copyright © 2011 Operational Research Society Ltd</rights><rights>Operational Research Society 2010</rights><rights>2015 INIST-CNRS</rights><rights>Operational Research Society 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c451t-e5f139fbb0b7df05554a40535a8ad611677854b9c5e1d206233cc7bde2d9d1823</citedby><cites>FETCH-LOGICAL-c451t-e5f139fbb0b7df05554a40535a8ad611677854b9c5e1d206233cc7bde2d9d1823</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/854929308/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/854929308?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11688,27924,27925,36060,44363,58238,58471,74895</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=23931232$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Ram Kumar, P N</creatorcontrib><creatorcontrib>Narendran, T T</creatorcontrib><title>On the usage of Lagrangean Relaxation for the convoy movement problem</title><title>The Journal of the Operational Research Society</title><addtitle>J Oper Res Soc</addtitle><description>The problem of routing military convoys between specific origin and destination pairs is known as convoy movement problem (CMP). In this study, we consider an existing mathematical model of CMP and propose a lower bounding procedure based on Lagrangean Relaxation. The robustness of the proposed procedure is evaluated on a variety of test problem instances. Encouraging results are obtained.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Business and Management</subject><subject>conflicts</subject><subject>Exact sciences and technology</subject><subject>Heuristics</subject><subject>Integer programming</subject><subject>Lagrange multipliers</subject><subject>Lagrangean Relaxation</subject><subject>Lagrangian function</subject><subject>Logistics</subject><subject>Management</subject><subject>Mathematics</subject><subject>military convoys</subject><subject>Militia movements</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Optimal solutions</subject><subject>Origin and destination</subject><subject>Roads &amp; highways</subject><subject>scheduling</subject><subject>Theoretical Paper</subject><subject>Theoretical Papers</subject><issn>0160-5682</issn><issn>1476-9360</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNptkN1LwzAUxYMoOKdPPotF8Ek7b5KmbR5lzA8YDESfQ9qms6NNNGmn--9N7Zwve7pczu-ekxyEzjFMMLDkbmWsmxDwa3SARjhK4pDTGA7RCHAMIYtTcoxOnFsBAAfMR2i20EH7roLOyaUKTBnM5dJKvVRSBy-qlt-yrYwOSmN_sdzotdkEjVmrRuk2-LAmq1Vzio5KWTt1tp1j9PYwe50-hfPF4_P0fh7mEcNtqFiJKS-zDLKkKIExFskIGGUylUWMcZwkKYsynjOFCwIxoTTPk6xQpOAFTgkdo6vB1-d-dsq1YmU6q32k8IeccAqph24GKLfGOatK8WGrRtqNwCD6mkRfk-hrEpGnr7eW0uWyLv3n88rtTgjlFBPaR98OnPOS78f-R--3vRxwLdvOqp1fz_RIT1wMxMq1xu6AyFtxTMHr8aBX2rffyC9j60K0clMb-_dKui_6B534nbY</recordid><startdate>20110401</startdate><enddate>20110401</enddate><creator>Ram Kumar, P N</creator><creator>Narendran, T T</creator><general>Taylor &amp; Francis</general><general>Palgrave Macmillan</general><general>Palgrave Macmillan UK</general><general>Taylor &amp; Francis Ltd</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>U9A</scope></search><sort><creationdate>20110401</creationdate><title>On the usage of Lagrangean Relaxation for the convoy movement problem</title><author>Ram Kumar, P N ; Narendran, T T</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c451t-e5f139fbb0b7df05554a40535a8ad611677854b9c5e1d206233cc7bde2d9d1823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Business and Management</topic><topic>conflicts</topic><topic>Exact sciences and technology</topic><topic>Heuristics</topic><topic>Integer programming</topic><topic>Lagrange multipliers</topic><topic>Lagrangean Relaxation</topic><topic>Lagrangian function</topic><topic>Logistics</topic><topic>Management</topic><topic>Mathematics</topic><topic>military convoys</topic><topic>Militia movements</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Optimal solutions</topic><topic>Origin and destination</topic><topic>Roads &amp; highways</topic><topic>scheduling</topic><topic>Theoretical Paper</topic><topic>Theoretical Papers</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ram Kumar, P N</creatorcontrib><creatorcontrib>Narendran, T T</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Global News &amp; ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Career &amp; Technical Education Database</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health &amp; Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Medical Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Collection</collection><collection>Computing Database</collection><collection>Health &amp; Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>ProQuest research library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>The Journal of the Operational Research Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ram Kumar, P N</au><au>Narendran, T T</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the usage of Lagrangean Relaxation for the convoy movement problem</atitle><jtitle>The Journal of the Operational Research Society</jtitle><stitle>J Oper Res Soc</stitle><date>2011-04-01</date><risdate>2011</risdate><volume>62</volume><issue>4</issue><spage>722</spage><epage>728</epage><pages>722-728</pages><issn>0160-5682</issn><eissn>1476-9360</eissn><coden>JORSDZ</coden><abstract>The problem of routing military convoys between specific origin and destination pairs is known as convoy movement problem (CMP). In this study, we consider an existing mathematical model of CMP and propose a lower bounding procedure based on Lagrangean Relaxation. The robustness of the proposed procedure is evaluated on a variety of test problem instances. Encouraging results are obtained.</abstract><cop>London</cop><pub>Taylor &amp; Francis</pub><doi>10.1057/jors.2010.4</doi><tpages>7</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0160-5682
ispartof The Journal of the Operational Research Society, 2011-04, Vol.62 (4), p.722-728
issn 0160-5682
1476-9360
language eng
recordid cdi_crossref_primary_10_1057_jors_2010_4
source ABI/INFORM Collection; JSTOR Archival Journals and Primary Sources Collection【Remote access available】; Taylor and Francis Science and Technology Collection
subjects Algorithms
Applied sciences
Business and Management
conflicts
Exact sciences and technology
Heuristics
Integer programming
Lagrange multipliers
Lagrangean Relaxation
Lagrangian function
Logistics
Management
Mathematics
military convoys
Militia movements
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimal solutions
Origin and destination
Roads & highways
scheduling
Theoretical Paper
Theoretical Papers
title On the usage of Lagrangean Relaxation for the convoy movement problem
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T09%3A20%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20usage%20of%20Lagrangean%20Relaxation%20for%20the%20convoy%20movement%20problem&rft.jtitle=The%20Journal%20of%20the%20Operational%20Research%20Society&rft.au=Ram%20Kumar,%20P%20N&rft.date=2011-04-01&rft.volume=62&rft.issue=4&rft.spage=722&rft.epage=728&rft.pages=722-728&rft.issn=0160-5682&rft.eissn=1476-9360&rft.coden=JORSDZ&rft_id=info:doi/10.1057/jors.2010.4&rft_dat=%3Cjstor_cross%3E41059130%3C/jstor_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c451t-e5f139fbb0b7df05554a40535a8ad611677854b9c5e1d206233cc7bde2d9d1823%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=854929308&rft_id=info:pmid/&rft_jstor_id=41059130&rfr_iscdi=true