Assignment-based MIP Modeling for Solving a Selling Firm mTSP with Time Limit Constraints

Mojahid Saeed Osman

Abstract

This paper presents a version of the multiple traveling salesmen problem with service time limit constraints and travel times. The time required to provide merchandising service at any outlet location is predetermined based on the customer type. The objective is to minimize the number of salesmen hired by a selling firm while visiting and providing services to all customers without exceeding salesmen’s allowed working times. The paper proposes an assignment-based mixed integer programming model for solving the salesmen problem of a selling firm that applies a sub-tour elimination restriction. A case example is presented for illustrating the applicability and suitability of the proposed approach for solving the problem tackled in this work.

Download


Paper Citation


in Harvard Style

Saeed Osman M. (2018). Assignment-based MIP Modeling for Solving a Selling Firm mTSP with Time Limit Constraints.In Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-285-1, pages 164-169. DOI: 10.5220/0006549201640169


in Bibtex Style

@conference{icores18,
author={Mojahid Saeed Osman},
title={Assignment-based MIP Modeling for Solving a Selling Firm mTSP with Time Limit Constraints},
booktitle={Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2018},
pages={164-169},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006549201640169},
isbn={978-989-758-285-1},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Assignment-based MIP Modeling for Solving a Selling Firm mTSP with Time Limit Constraints
SN - 978-989-758-285-1
AU - Saeed Osman M.
PY - 2018
SP - 164
EP - 169
DO - 10.5220/0006549201640169