Abstract
In automated contracting, bid evaluation is a complex process because the task of finding the optimal set of bids requires the consideration of several factors such as time constraints, risk estimates and price. There have been attempts in the recent past (such as the use of simulated-annealing) to solve the bid evaluation problem in an automated contracting environment. This research endeavors to offer a better alternative to the solution of the bid evaluation problem by adopting the genetic local search (GLS) method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aarts, E., Stehouwer, H.P.: Neural Networks and the Travelling Salesman Problem. In: Proceedings International Conference on Artificial Neural Networks, pp. 960–966. Springer, Heidelberg (1993)
Alvarez, M. F. R.: A Genetic Local Search Approach To The Bid Evaluation Problem In An Automated Contracting Environment. A Thesis Presented to the Faculty of the Graduate School of the College of Computer Studies, De La Salle University (2002)
Bakos, Y.: The Emerging Role of Electronic Marketplaces on the Internet. Communications of the ACM, 33–42 (1998)
Beam, C., Segev, A.: Automated Negotiations: A Survey of the State of the Art. Technical Report CITM Working Paper 96-WP-1022, Walter A. Hass School of Business (1997)
Collins, J., Sundareswara, R., Tsvetovat, M., Gini, M., Mobasher, B.: Search Strategies for Bid Selection in Multi-Agent Contracting. Agent-mediated Electronic Commerce. In: Proceedings of IJCAI 1999, Stockholm, Sweden (1999)
Collins, J., Sundareswara, R., Tsvetovat, M., Gini, M., Mobasher, B.: Multi- Agent Contracting for Supply-Chain Management. Technical Report 00-010, University of Minnesota (2000)
Durbin, R., Sacliski, R., Yuille, A.: An Analysis of the Elastic Net Approach to the Traveling Salesman Problem. Neural Computation 1, 348–358 (1989)
Fiechter, L.: A Parallel Tabu Seach Algorithm for Large Traveling Salesman Problems. Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 243–267 (1994)
Freisleben, B., Schulte, M.: Combinatorial Optimization with Parallel Adaptive Threshold Accepting. In: Proceedings of 1992 European Workshop on Parallel Computing, Barcelona, pp. 176–179. TOS Press (1992)
Freisleben, B., Merz, P.: A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems. In: Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, Nagoya, Japan, pp. 616–621 (1996)
Gambardella, L.M., Dorigo, M.: Ant-Q: A Reinforcement Learning Approach to the Travelling Salesman Problem. In: Proceedings of 18th International Conference on Machine Learning, pp. 252–260. Morgan Kaufmann, San Francisco (1996)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
Guttman, R., Maes, P.: Cooperative vs. Competitive Multi-agent Negotiations in Retail Electronic Commerce. In: 2nd International Workshop on Cooperative Information Agents (1998)
Guttman, R., Moukas, A., Maes, P.: Agent-mediated Electronic Commerce: A Survey. Knowledge Engineering Review (1998)
Homaifar, L., Guan, C., Liepins, G.: A New Approach to the Travelling Salesman Problem by Genetic Algorithms. In: Proc. 5th International Conference on Genetic Algorithms, pp. 460–466. Morgan Kaufmann, San Francisco (1993)
Merz, P., Freisleben, B.: Genetic Local Search for the TSP: New Results. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pp. 159–164. IEEE Press, Los Alamitos (1997)
Merz, P., Freisleben, B.: On the Effectiveness of Evolutionary Search in High-Dimensional NK-Landscapes. In: Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pp. 741–745. IEEE Press, Los Alamitos (1998)
Merz, P., Freisleben, B.: A Genetic Local Search Approach to the Quadratic Assignment Problem (1999) (a manuscript)
Merz, P., Freisleben, B.: Fitness Landscapes, Memetic Algorithms and Greedy Operators for Graph Bi-Partitioning. Evolutionary Computation (1999)
Merz, P., Freisleben, B.: Genetic Algorithms for Binary Quadratic Programming. In: Proceedings of the Genetic and Evolutionary Computation Conference. Morgan Kaufmann, San Francisco (1999)
Reinelt, G.: The Traveling Salesman. LNCS, vol. 840. Springer, Heidelberg (1994)
Sycara, K., Decker, K., Williamson, M.: Middle-agents for the Internet. In: Proceedings of the 15th Joint Conference on Artificial Intelligence (1997)
Ulder, N., Aarts, E., Bandelt, H., van Laarhoven, P., Pesch, E.: Genetic Local Search Algorithms for the Traveling Salesman Problem. In: Schwefel, H.-P., Männer, R. (eds.) PPSN 1990. LNCS, vol. 496, pp. 109–116. Springer, Heidelberg (1991)
Van Laarhoven, P., Aarts, E.H.L.: Simulated Annealing: Theory and Applications. Kluwer Academic Publishers, Dordrecht (1987)
Wagner, G.: A UML Profile for External AOR Models. In: Giunchiglia, F., Odell, J.J., Weiss, G. (eds.) AOSE 2002. LNCS, vol. 2585, pp. 99–110. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alvarez, M.F.R., de Dios Bulos, R. (2003). Genetic Local Search in an Automated Contracting Environment. In: Bauknecht, K., Tjoa, A.M., Quirchmayr, G. (eds) E-Commerce and Web Technologies. EC-Web 2003. Lecture Notes in Computer Science, vol 2738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45229-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-45229-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40808-6
Online ISBN: 978-3-540-45229-4
eBook Packages: Springer Book Archive